Fast heuristics for the maximum feasible subsystem problem

被引：57
|
作者：
Chinneck, JW [1 ]
机构：
[1] Carleton Univ, Ottawa, ON K1S 5B6, Canada
来源：
INFORMS JOURNAL ON COMPUTING | 2001年 / 13卷 / 03期
关键词：
linear programming; artificial intelligence; heuristic; analysis of algorithms;
D O I：
10.1287/ijoc.13.3.210.12632
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Given an infeasible set of linear constraints, finding the maximum cardinality feasible subsystem is known as the maximum feasible subsystem problem. This problem is known to be NP-hard, but has many practical applications. This paper presents improved heuristics for solving the maximum feasible subsystem problem that are significantly faster than the original, but still highly accurate.
引用
收藏
页码：210 / 223
页数：14
相关论文
共 50 条
  • [1] Branch-and-cut for the maximum feasible subsystem problem
    Pfetsch, Marc E.
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2008, 19 (01) : 21 - 38
  • [2] Randomized relaxation methods for the maximum feasible subsystem problem
    Amaldi, E
    Belotti, P
    Hauser, R
    [J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2005, 3509 : 249 - 264
  • [3] Some structural and algorithmic properties of the maximum feasible subsystem problem
    Amaldi, E
    Pfetsch, ME
    Trotter, LE
    [J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1999, 1610 : 45 - 59
  • [4] On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
    Edoardo Amaldi
    Marc E. Pfetsch
    Leslie E. Trotter, Jr.
    [J]. Mathematical Programming, 2003, 95 : 533 - 554
  • [5] On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
    Amaldi, E
    Pfetsch, ME
    Trotter, LE
    [J]. MATHEMATICAL PROGRAMMING, 2003, 95 (03) : 533 - 554
  • [6] On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
    Elbassioni, Khaled
    Raman, Rajiv
    Ray, Saurabh
    Sitters, Rene
    [J]. PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 1210 - +
  • [7] A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
    Amaldi, Edoardo
    Bruglieri, Maurizio
    Casale, Giuliano
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (05) : 1465 - 1482
  • [8] Simple and fast surrogate constraint heuristics for the maximum independent set problem
    Alidaee, Bahram
    Kochenberger, Gary
    Wang, Haibo
    [J]. JOURNAL OF HEURISTICS, 2008, 14 (06) : 571 - 585
  • [9] Simple and fast surrogate constraint heuristics for the maximum independent set problem
    Bahram Alidaee
    Gary Kochenberger
    Haibo Wang
    [J]. Journal of Heuristics, 2008, 14 : 571 - 585
  • [10] On Finding the Maximum Feasible Subsystem of a System of Linear Inequalities
    Katerinochkina N.N.
    Ryazanov V.V.
    Vinogradov A.P.
    Wang L.
    [J]. Pattern Recognition and Image Analysis, 2018, 28 (2) : 169 - 173
12345