Some structural and algorithmic properties of the maximum feasible subsystem problem

DOI10.1007/3-540-48777-8_4MaRDI QIDQ4263701zbMATH OpenFDO

Authors E. Amaldi, Leslie E. jun. Trotter, Marc Emanuel Pfetsch

Publication date 21 November 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48777-8_4

zbMATH Keywords

largest feasible subsystemlinear programminglinear systemsimpler decompositionSteinitz problem

Mathematics Subject Classification ID

Decomposition methods (49M27) Numerical computation of solutions to systems of equations (65H10) Linear programming (90C05)

Recommendations

• The maximum feasible subset problem (maxFS) and applications
• Branch-and-Cut for the Maximum Feasible Subsystem Problem
• scientific article; zbMATH DE number 2186837
• Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem

Cited in

(22)

• Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
• The MIN PFS problem and piecewise linear model estimation
• The complexity and approximability of finding maximum feasible subsystems of linear relations
• On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
• Approximating minimal unsatisfiable subformulae by means of adaptive core search
• On exact selection of minimally unsatisfiable subformulae
• Automatic repair of convex optimization problems
• Irreducible infeasible subsystems of semidefinite systems
• A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
• Faster maximum feasible subsystem solutions for dense constraint matrices
• Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae
• Fast heuristics for the maximum feasible subsystem problem
• Dual averaging with adaptive random projection for solving evolving distributed optimization problems
• Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem
• Branch-and-Cut for the Maximum Feasible Subsystem Problem
• Identifying Minimally Infeasible Subsystems of Inequalities
• On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
• Preferential reducts and constructs in robust multiple criteria ranking and sorting
• A subgradient-based approach for finding the maximum feasible subsystem with respect to a set
• Deletion presolve for accelerating infeasibility diagnosis in optimization models
• Combinatorial geometry and graphs in an analysis of infeasible systems and pattern recognition
• The maximum feasible subset problem (maxFS) and applications

This page was built for publication: Some structural and algorithmic properties of the maximum feasible subsystem problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263701)