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
無制限整数ナップサック問題をめぐる話題 = Subjects...
Similar by person
Narrow search
Delete all filters
| 1 applied filter
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
more ...
less ...
Type of publication
All
Book / Working Paper
1
Language
All
Undetermined
1
Author
All
Iida, Hiroshi
1
Institution
All
Department of Economics, Otaru University of Commerce
1
Published in...
All
ビジネス創造センターディスカッション・ペーパー (Discussion papers of the Center for Business Creation)
1
Source
All
RePEc
1
Showing
1
-
1
of
1
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:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
