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 条
  • [21] Logspace Optimization Problems and Their Approximability Properties
    Till Tantau
    Theory of Computing Systems, 2007, 41 : 327 - 350
  • [22] Some Undecidable Problems on Approximability of NP Optimization Problems
    黄雄
    Journal of Computer Science and Technology, 1996, (02) : 126 - 132
  • [23] Some undecidable problems on approximability of NP optimization problems
    Xiong, Huang
    Journal of Computer Science and Technology, 1996, 11 (02): : 126 - 132
  • [24] A Multi-heuristic Algorithmic Skeleton for Hard Combinatorial Optimization Problems
    Melnikov, B. F.
    Tsyganov, A. V.
    Bulychov, O. I.
    INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL SCIENCES AND OPTIMIZATION, VOL 1, PROCEEDINGS, 2009, : 33 - +
  • [25] An Efficient Structured Perceptron for NP-Hard Combinatorial Optimization Problems
    Vejar, Bastian
    Aglin, Gael
    Mahmutogullari, Ali Irfan
    Nijssen, Siegfried
    Schaus, Pierre
    Guns, Tias
    INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, PT II, CPAIOR 2024, 2024, 14743 : 253 - 262
  • [26] Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
    Toth, P
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 125 (02) : 222 - 238
  • [27] On the (In)approximability of Combinatorial Contracts
    Ezra, Tomer
    Feldman, Michal
    Schlesinger, Maya
    15TH INNOVATIONS IN THEORETICAL COMPUTER SCIENCE CONFERENCE, ITCS 2024, 2024,
  • [28] On the approximability of minmax (regret) network optimization problems
    Kasperski, Adam
    Zieliniski, Pawel
    INFORMATION PROCESSING LETTERS, 2009, 109 (05) : 262 - 266
  • [29] Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
    Goel, Gagan
    Karande, Chinmay
    Tripathi, Pushkar
    Wang, Lei
    ACM SIGECOM EXCHANGES, 2010, 9 (01)
  • [30] Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
    Goel, Gagan
    Karande, Chinmay
    Tripathi, Pushkar
    Wang, Lei
    2009 50TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE: FOCS 2009, PROCEEDINGS, 2009, : 755 - 764
12345