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
Retain my current filters
~subject:"組合せ最適化"
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
Partition のある風景
Similar by person
Narrow search
Delete all filters
| 1 applied filter
Year of publication
From:
To:
Subject
All
組合せ最適化
Budget distribution problem
2
Heteroskedastic error
2
Labor Unions
2
Model Averaging
2
additivity
2
fiscal reconstruction
2
rights-egalitarian solution
2
rights-weighted solution
2
ナップサック問題
2
Administrative Reform Incentive Assessment
1
Akaike information criterion
1
Anti-dumping tariffs
1
Asia
1
Asymptotic Optimality
1
Average Treatment Effect
1
Bhutan
1
Bounded Knapsack
1
Branch-and-bound
1
CMEA
1
Closely related products
1
Collapsing knapsack problem
1
Combinatorial Optimisation
1
Cournot duopoly
1
Customs union
1
Demand independence
1
Depth-first search
1
Domestic relative price effect
1
Dumping
1
EEC
1
Endogenous Protection
1
Equilibrium selection
1
Evolutionarily stable set
1
Excel’s Macro
1
Externalities
1
Factor Returns
1
Folk theorem
1
Foreign trade relative price effect
1
Gravity Model
1
Importance Analysis
1
more ...
less ...
Type of publication
All
Book / Working Paper
2
Article
1
Language
All
Undetermined
3
Author
All
Iida, Hiroshi
3
Institution
All
Department of Economics, Otaru University of Commerce
2
Published in...
All
ビジネス創造センターディスカッション・ペーパー (Discussion papers of the Center for Business Creation)
2
商学討究 (Shogaku Tokyu)
1
Source
All
RePEc
3
Showing
1
-
3
of
3
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
整数ナップサック問題が多項式時間で解ける特殊な場合を定める条件について
Iida, Hiroshi
-
Department of Economics, Otaru University of Commerce
-
2005
整数ナップサック問題は, よく知られた0–1 ナップサック問題の数ある拡張の一つである.0–1 ナップサック問題の拡張ゆえに, 整数ナップサック問題も容易には解けない問題であり,...
Persistent link: https://www.econbiz.de/10010965507
Saved in:
2
頂点被覆へのリスト減少法の解析に関する一考察
Iida, Hiroshi
-
Department of Economics, Otaru University of Commerce
-
2007
頂点被覆は, NP 困難な組合せ最適化問題ゆえに, 多項式時間では解き得ないと考えられている. 他方, 頂点被覆にはいくつかの近似解法が提案されている. これら近似解法には, 大きく分けて二種類, 即ち,...
Persistent link: https://www.econbiz.de/10010965515
Saved in:
3
各項の個数に上限のある整数ナップサックについて = A Memorandum Regarding the Bounded Knapsack Problem
Iida, Hiroshi
- In:
商学討究 (Shogaku Tokyu)
62
(
2011
)
2/3
,
pp. 247-250
Persistent link: https://www.econbiz.de/10010964552
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
