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
Maximin型の目的函数を持つナップサック問題に関する考察...
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
-
2007
頂点被覆は, NP 困難な組合せ最適化問題ゆえに, 多項式時間では解き得ないと考えられている. 他方, 頂点被覆にはいくつかの近似解法が提案されている. これら近似解法には, 大きく分けて二種類, 即ち,...
Persistent link: https://www.econbiz.de/10010965515
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
