Approximability of hard combinatorial optimization problems: an introduction

被引：0

作者：

Francesco Maffioli

Giulia Galbiati

机构：

[1] Politecnico di Milano,Dipartimento di Elettronica

[2] Università di Pavia,undefined

来源：

Annals of Operations Research | 2000年 / 96卷

关键词：

Feasible Solution; Polynomial Time; Performance Ratio; Span Tree Problem; Polynomial Time Approximation Scheme;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：221 / 236

页数：15

共 50 条

[41] ON SIMPLE COMBINATORIAL OPTIMIZATION PROBLEMS
HOFFMAN, AJ
DISCRETE MATHEMATICS, 1992, 106 : 285 - 289
[42] The matrices in the problems of the combinatorial optimization
Timofeeva, N.K.
Problemy Upravleniya I Informatiki (Avtomatika), 1996, (03): : 104 - 113
[43] Explanations for combinatorial optimization problems
Erwig, Martin
Kumar, Prashant
JOURNAL OF COMPUTER LANGUAGES, 2024, 79
[44] On combinatorial vector optimization problems
1995, VSP Int Sci Publ, Zeist, Netherlands (05):
[45] Combinatorial approaches for hard problems in manpower scheduling
Lau, HC
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1996, 39 (01) : 88 - 98
[46] Semidefinite and Lagrangian relaxations for hard combinatorial problems
Wolkowicz, H
SYSTEM MODELLING AND OPTIMIZATION: METHODS, THEORY AND APPLICATIONS, 2000, 46 : 269 - 309
[47] LOCAL SEARCH, REDUCIBILITY AND APPROXIMABILITY OF NP-OPTIMIZATION PROBLEMS
AUSIELLO, G
PROTASI, M
INFORMATION PROCESSING LETTERS, 1995, 54 (02) : 73 - 79
[48] On fixed-parameter tractability and approximability of NP optimization problems
Cai, LM
Chen, JN
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1997, 54 (03) : 465 - 474
[49] Combinatorial genetic algorithm for solving combinatorial optimization problems
Ou, Yongbin
Peng, Jiahong
Peng, Hong
Jishou Daxue Xuebao/Journal of Jishou University, 1999, 20 (01): : 42 - 45
[50] Strong bounds on the approximability of two Pspace-hard problems in propositional planning
Peter Jonsson
Annals of Mathematics and Artificial Intelligence, 1999, 26 : 133 - 147

← 1 2 3 4 5 →