Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter, Jr.  Home/Search
Context
Related
| math.tuberlin.de/pub/com...maxfs.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: math.tuberlin.de/~...research_en (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the MAX FS problem: For a given infeasible linear system Ax b, determine a feasible subsystem containing as many inequalities as possible. This problem, which is NP-hard and also difficult to approximate, has a number of interesting applications in a wide range of fields. In this paper we examine structural and algorithmic properties of MAX FS and of Irreducible Infeasible Subsystems (IISs), which are intrinsically related since one must delete at least one constraint from... (Update)
Similar documents (at the sentence level):
9.4%: Some Structural and Algorithmic Properties of the.. - Amaldi, Pfetsch.. (2000) (Correct)
Active bibliography (related documents): More All
1.5: On the approximability of some NP-hard minimization problems.. - Amaldi, Kann (1996) (Correct)
1.5: On the Approximability of Some NP-hard Minimization Problems.. - Amaldi, Kann (1996) (Correct)
1.3: On the Approximability of Minimizing Nonzero Variables Or.. - Amaldi, Kann (1997) (Correct)
Similar documents based on text: More All
1.0: Maximum Feasible Subsystem Problem and Vertex-Facet Incidences of .. - Pfetsch (Correct)
0.3: The Complexity and Approximability of Finding Maximum Feasible .. - Amaldi, Kann (1993) (Correct)
0.2: Vertex-Facet Incidences of Unbounded Polyhedra - Joswig, Kaibel, Pfetsch, Ziegler (2000) (Correct)
BibTeX entry: (Update)
@misc{ amaldi-maximum,
author = "Edoardo Amaldi and Marc E. Pfetsch and Leslie E. Trotter and Jr.",
title = "On the Maximum Feasible Subsystem Problem, IISs and IIS-Hypergraphs",
url = "citeseer.ist.psu.edu/amaldi02maximum.html" }
Citations (may not include all citations):4212 Computers and Intractability: A guide to the theory of NP-co.. (context) - GAREY, JOHNSON - 1979
245 Graphs and Hypergraphs (context) - BERGE - 1976
128 Complexity and Real Computation (context) - BLUM, CUCKER et al. - 1997
120 The hardness of approximate optima in lattices (context) - ARORA, BABAI et al. - 1997
97 Lectures on Polytopes - ZIEGLER
69 Some optimal inapproximability results (context) - ASTAD - 2001
48 The complexity and approximability of finding maximum feasib.. - AMALDI, KANN - 1995
35 Topological methods (context) - ORNER - 1995
27 Computational Synthetic Geometry (context) - BOKOWSKI, STURMFELS - 1989
26 Misclassification minimization - MANGASARIAN - 1994
19 the approximability of minimizing nonzero variables or unsat.. - AMALDI, KANN - 1998
17 perceptron learning rule (context) - FREAN, thermal - 1992
14 Locating minimal infeasible constraint sets in linear progra.. (context) - CHINNECK, DRAVNIEKS - 1991
14 The universality theorems on the classification problem of c.. (context) - EV - 1988
14 From finding maximum feasible subsystems of linear systems t.. (context) - AMALDI - 1994
14 Encyclopedia of Mathematics and its Applications (context) - ORNER, VERGNAS et al. - 1999
12 Realization Spaces of Polytopes (context) - RICHTER-GEBERT - 1996
10 Computational real algebraic geometry - MISHRA - 1997
10 On systems of linear inequalities (context) - FAN - 1956
10 Identifying minimally infeasible subsystems of inequalities (context) - GLEESON, RYAN - 1990
9 A parametric optimization method for machine learning - BENNETT, BREDENSTEINER - 1997
8 A generalization of antiwebs to independence systems and the.. (context) - LAURENT - 1989
7 Approaches to diagnosing infeasible linear programs (context) - GREENBERG, MURPHY - 1991
7 Trees and Hills: Methodology for Maximizing Functions of Sys.. (context) - GREER - 1984
6 Finding the minimum weight IIS cover of an infeasible system.. (context) - PARKER, RYAN - 1996
6 The densest hemisphere problem (context) - JOHNSON, PREPARATA - 1978
6 An effective polynomial-time heuristic for the minimum-cardi.. (context) - CHINNECK - 1996
5 A set covering approach to infeasibility analysis of linear .. - PARKER - 1995
5 Some results concerning post-infeasibility analysis (context) - CHAKRAVARTI - 1994
5 A note on resolving infeasibility in linear programs by cons.. (context) - SANKARAN - 1993
5 Some structural and algorithmic properties of the maximum fe.. - AMALDI, PFETSCH et al. - 1999
4 Transversals of IIS-hypergraphs (context) - RYAN - 1991
4 and implied equalities in linear systems (context) - GREENBERG, redundancy - 1996
3 Irreducibly inconsistent systems of linear inequalities (context) - VAN LOON - 1981
3 Set covering problem (context) - CERIA, NOBILI et al. - 1997
3 the set covering polytope: All the facets with coefficients (context) - BALAS, NG - 1989
3 Beitrage zur Theorie der Linearen Ungleichungen (context) - MOTZKIN - 1933
2 Computer codes for the analysis of infeasible linear program.. (context) - CHINNECK - 1996
2 IIS-hypergraphs (context) - RYAN - 1996
1 Vertex-facet incidences of unbounded polyhedra - JOSWIG, KAIBEL et al. - 2001
1 The MIN PFS problem and piecewise linear model estimation (context) - AMALDI, MATTAVELLI - 2002
1 Detecting IIS in infeasible linear programmes using techniqu.. (context) - TAMIZ, MARDLE et al. - 1996
1 Examples of generalized antiweb facets (context) - PFETSCH
1 Fast heuristics for the maximum feasible subsystem problem (context) - CHINNECK - 2001
1 Models and algorithms for terrestrial digital broadcasting (context) - ROSSI, SASSANO et al. - 2001
1 Finding a useful subset of constraints for analysis in an in.. (context) - CHINNECK - 1997
1 Diagnosing infeasibilities in network flow problems - AGGARWAL, AHUJA et al. - 1998
1 Randomized relaxation methods for the maximum feasible subsy.. (context) - AMALDI, HAUSER - 2001
http://www.netlib.org
Documents on the same site (http://www.math.tu-berlin.de/~pfetsch/research_en.html): More
Computing the Face Lattice of a Polytope from its.. - Kaibel, Pfetsch (2001) (Correct)
Maximum Feasible Subsystem Problem and Vertex-Facet Incidences of .. - Pfetsch (Correct)
Some Algorithmic Problems in Polytope Theory - Kaibel, Pfetsch (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC