GENERAL TECHNIQUES FOR APPROXIMATE COMBINATORIAL OPTIMIZATION

被引：0

作者：

SAHNI, S ^{[1
]}

机构：

[1] UNIV MINNESOTA,DEPT COMP SCI,MINNEAPOLIS,MN 55455

来源：

OPERATIONS RESEARCH | 1975年 / 23卷

关键词：

D O I：

暂无

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：B299 / B299

页数：1

共 50 条

[1] Approximate local search in combinatorial optimization
Orlin, JB
Punnen, AP
Schulz, AS
[J]. SIAM JOURNAL ON COMPUTING, 2004, 33 (05) : 1201 - 1214
[2] ON APPROXIMATE SOLUTIONS FOR COMBINATORIAL OPTIMIZATION PROBLEMS
SIMON, HU
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1990, 3 (02) : 294 - 310
[3] GENERAL TECHNIQUES FOR COMBINATORIAL APPROXIMATION
SAHNI, S
[J]. OPERATIONS RESEARCH, 1977, 25 (06) : 920 - 936
[4] Quantum approximate optimization for combinatorial problems with constraints
Ruan, Yue
Yuan, Zhiqiang
Xue, Xiling
Liu, Zhihao
[J]. INFORMATION SCIENCES, 2023, 619 : 98 - 125
[5] New AI Techniques for Combinatorial Optimization
Lallouet, Arnaud
[J]. INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS, 2022, 31 (03)
[6] Neural techniques for combinatorial optimization with applications
Smith, K
Palaniswami, M
Krishnamoorthy, M
[J]. IEEE TRANSACTIONS ON NEURAL NETWORKS, 1998, 9 (06): : 1301 - 1318
[7] On scenario aggregation to approximate robust combinatorial optimization problems
Chassein, Andre
Goerigk, Marc
[J]. OPTIMIZATION LETTERS, 2018, 12 (07) : 1523 - 1533
[8] Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation
Yasushi Kawase
Hanna Sumita
[J]. Algorithmica, 2024, 86 : 566 - 584
[9] On scenario aggregation to approximate robust combinatorial optimization problems
André Chassein
Marc Goerigk
[J]. Optimization Letters, 2018, 12 : 1523 - 1533
[10] Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation
Kawase, Yasushi
Sumita, Hanna
[J]. ALGORITHMICA, 2024, 86 (02) : 566 - 584

← 1 2 3 4 5 →