Polynomial and Pseudopolynomial Algorithms for Solving Combinatorial Problems.

被引：0

|

作者：

Blazewicz, Jacek

机构：

来源：

Archiwum Automatyki i Telemechaniki | 1980年 / 25卷 / 03期

关键词：

Compendex;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

MATHEMATICAL TECHNIQUES

引用

收藏

页码：355 / 366

相关论文

共 50 条

[41] Algorithms and reductions for rewriting problems. II
Verma, R
INFORMATION PROCESSING LETTERS, 2002, 84 (04) : 227 - 233
[42] The Kth TSP is pseudopolynomial when TSP is polynomial
Chaourar, Brahim
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2018, 10 (05)
[43] APPROXIMATION ALGORITHMS FOR COMBINATORIAL PROBLEMS
JOHNSON, DS
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 9 (03) : 256 - 278
[44] ALGORITHMS FOR SOLVING SYSTEMS OF POLYNOMIAL EQUATIONS
YUN, DYY
SIAM REVIEW, 1974, 16 (01) : 141 - 141
[45] TECHNIQUE FOR INTERACTIVE SOLUTION OF A CLASS OF LOGICAL AND COMBINATORIAL PROBLEMS.
Martinsons, Ya.Ya.
Fritsnovich, G.F.
Automatic Control and Computer Sciences, 1985, 19 (06) : 65 - 73
[46] 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
[47] A BRIEF INTRODUCTION TO EXACT, APPROXIMATION, AND HEURISTIC ALGORITHMS FOR SOLVING HARD COMBINATORIAL OPTIMIZATION PROBLEMS
Festa, P.
2014 16TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS (ICTON), 2014,
[48] Solving Nonnative Combinatorial Optimization Problems Using Hybrid Quantum-Classical Algorithms
Wurtz, Jonathan
Sack, Stefan H.
Wang, Sheng-Tao
IEEE TRANSACTIONS ON QUANTUM ENGINEERING, 2024, 5
[49] APPROXIMATE REASONING FOR SOLVING FUZZY MCDM PROBLEMS.
Carlsson, Christer
1600, (18):
[50] ALGORITHM FOR SOLVING A CLASS OF MULTISTAGE TRANSPORTATION PROBLEMS.
Sayed Ali Osman, Mohamed
Elsayed M. Ellaimony, Elsayed
Modelling, Measurement and Control C, 1984, 1 (02): : 43 - 56

← 1 2 3 4 5 →