Branch-and-Cut for the Maximum Feasible Subsystem Problem
From MaRDI portal
Publication:3608970
DOI10.1137/050645828zbMATH Open1167.90018OpenAlexW1971697593MaRDI QIDQ3608970FDOQ3608970
Authors: Marc E. Pfetsch 
Publication date: 6 March 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050645828
Recommendations
- scientific article; zbMATH DE number 1342119
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
- On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
- The maximum feasible subset problem (maxFS) and applications
- scientific article; zbMATH DE number 2186837
branch-and-cutinfeasible linear inequality systemirreducible infeasible subsystem (IIS)maximum feasible subsystem problemminimum IIS-cover
Cited In (20)
- A subgradient-based approach for finding the maximum feasible subsystem with respect to a set
- Fast heuristics for the maximum feasible subsystem problem
- Estimating the Size of Branch-and-Bound Trees
- Cardinality minimization, constraints, and regularization: a survey
- Identifying relatively irreducible infeasible subsystems of linear inequalities
- Complexity of minimum irreducible infeasible subsystem covers for flow networks
- The maximum feasible subset problem (maxFS) and applications
- Automatic repair of convex optimization problems
- Dual averaging with adaptive random projection for solving evolving distributed optimization problems
- Optimization approaches to supervised classification
- Extending linear relaxation for non-square matrices and soft constraints
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
- On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
- Faster maximum feasible subsystem solutions for dense constraint matrices
- SCIP: solving constraint integer programs
- Branch-and-cut for complementarity-constrained optimization
- Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem
- Hildreth's algorithm with applications to soft constraints for user interface layout
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
- Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions
Uses Software
This page was built for publication: Branch-and-Cut for the Maximum Feasible Subsystem Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608970)
