//--> //--> //--> //-->
Toggle navigation
Logout
Change account settings
EN
DE
ES
FR
A-Z
Beta
About EconBiz
News
Thesaurus (STW)
Research Skills
Help
EN
DE
ES
FR
My account
Logout
Change account settings
Login
Publications
Events
Your search terms
Search
Search options
All Fields
Title
Exact title
Subject
Author
Institution
ISBN/ISSN
Published in...
Publisher
Open Access only
Advanced
Search history
My EconBiz
Favorites
Loans
Reservations
Fines
You are here:
Home
無制限整数ナップサック問題をめぐる話題 = Subjects...
Similar by person
Narrow search
Narrow search
Year of publication
From:
To:
Subject
All
組合せ最適化
3
ナップサック問題
2
Bounded Knapsack
1
Branch-and-bound
1
Collapsing knapsack problem
1
Combinatorial Optimisation
1
Depth-first search
1
Knapsack Problem
1
Penalty
1
Strongly correlated knapsack problem
1
Subset-sum problem
1
多項式アルゴリズム
1
貪欲法
1
近似アルゴリズム
1
近似率
1
集合被覆
1
頂点被覆
1
more ...
less ...
Type of publication
All
Article
11
Book / Working Paper
10
Language
All
Undetermined
21
Author
All
Iida, Hiroshi
21
Uno, Takeaki
1
Institution
All
Department of Economics, Otaru University of Commerce
10
Published in...
All
ビジネス創造センターディスカッション・ペーパー (Discussion papers of the Center for Business Creation)
10
商学討究 (Shogaku Tokyu)
10
Journal of the Operations Research Society of Japan : JORSJ
1
Source
All
RePEc
20
OLC EcoSci
1
Showing
11
-
20
of
21
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
11
整数ナップサック問題が多項式時間で解ける特殊な場合を定める条件について
Iida, Hiroshi
-
Department of Economics, Otaru University of Commerce
-
2005
整数ナップサック問題は, よく知られた0–1 ナップサック問題の数ある拡張の一つである.0–1 ナップサック問題の拡張ゆえに, 整数ナップサック問題も容易には解けない問題であり,...
Persistent link: https://www.econbiz.de/10010965507
Saved in:
12
頂点被覆へのリスト減少法の解析に関する一考察
Iida, Hiroshi
-
Department of Economics, Otaru University of Commerce
-
2007
頂点被覆は, NP 困難な組合せ最適化問題ゆえに, 多項式時間では解き得ないと考えられている. 他方, 頂点被覆にはいくつかの近似解法が提案されている. これら近似解法には, 大きく分けて二種類, 即ち,...
Persistent link: https://www.econbiz.de/10010965515
Saved in:
13
Partition のある風景
Iida, Hiroshi
-
Department of Economics, Otaru University of Commerce
-
2008
本稿では, Partition からのreduction によって近似率を導出した事例を三つ, 紹介するとともに, それら事例をもとに, 若干の考察を加える.
Persistent link: https://www.econbiz.de/10010965517
Saved in:
14
整数ナップサックの周期性についてあれこれ
Iida, Hiroshi
-
Department of Economics, Otaru University of Commerce
-
2013
Persistent link: https://www.econbiz.de/10010965525
Saved in:
15
整数ナップサックの周期性について
Iida, Hiroshi
-
Department of Economics, Otaru University of Commerce
-
2009
Persistent link: https://www.econbiz.de/10010965527
Saved in:
16
Discussion paper series no.118 への補遺
Iida, Hiroshi
-
Department of Economics, Otaru University of Commerce
-
2009
Persistent link: https://www.econbiz.de/10010965537
Saved in:
17
Comments on knapsack problems with a penalty
Iida, Hiroshi
-
Department of Economics, Otaru University of Commerce
-
2007
The classical binary knapsack problem has numerous generalisations in relation to not only a capacity constraint but also an objective function. In 2006, two knapsack problems have coincidentally been proposed, both of which have an extension of the objective function paying the penalty. This...
Persistent link: https://www.econbiz.de/10010604745
Saved in:
18
How to solve the collapsing subset-sum problem revisited
Iida, Hiroshi
-
Department of Economics, Otaru University of Commerce
-
2011
This is a revised version of Iida [5]: We introduce a new type of problem that we shall call collapsing subset-sum problem, and present an algorithm to solve the problem. The problem is a special case of the collapsing knapsack problem, and the algorithm based on a depth-first branch-and-bound...
Persistent link: https://www.econbiz.de/10010604768
Saved in:
19
A Short Note on the Reducibility of the Collapsing Knapsack Problem
Iida, Hiroshi
;
Uno, Takeaki
- In:
Journal of the Operations Research Society of Japan : JORSJ
45
(
2002
)
3
,
pp. 293-298
Persistent link: https://www.econbiz.de/10006721907
Saved in:
20
ナップサック問題への2近似算法について雑感
Iida, Hiroshi
-
Department of Economics, Otaru University of Commerce
-
2014
Persistent link: https://www.econbiz.de/10011157043
Saved in:
First
Prev
1
2
3
Next
Last
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
//-->