Analyzing Infeasible Mixed-Integer and Integer Linear Programs
From MaRDI portal
Recommendations
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- scientific article; zbMATH DE number 1163815
- An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
- Irreducible infeasible sets in convex mixed-integer programs
Cited in
(30)- A conflict-directed approach to chance-constrained mixed logical linear programming
- A clone-based graphical modeler and mathematical model generator for optimal production planning in process industries
- Computational aspects of infeasibility analysis in mixed integer programming
- On exact selection of minimally unsatisfiable subformulae
- Experiments with conflict analysis in mixed integer programming
- Approaches to Diagnosing Infeasible Linear Programs
- Human-centred feasibility restoration in practice
- Solution techniques for the large set covering problem
- Extending linear relaxation for non-square matrices and soft constraints
- Certificates of linear mixed integer infeasibility
- Error correction for massive datasets
- Combinatorial optimization: current successes and directions for the future
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
- Generalized filtering algorithms for infeasibility analysis
- Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures
- Conflict analysis in mixed integer programming
- Computer Codes for the Analysis of Infeasible Linear Programs
- Analyzing infeasible nonlinear programs
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- On optimal zero-preserving corrections for inconsistent linear systems
- Using matching to detect infeasibility of some integer programs
- Irreducible infeasible sets in convex mixed-integer programs
- Minimal infeasible constraint sets in convex integer programs
- Diagnosing infeasible optimization problems using large language models
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- Hildreth's algorithm with applications to soft constraints for user interface layout
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Harvey Greenberg: analyzing infeasible mathematical programs
- Deletion presolve for accelerating infeasibility diagnosis in optimization models
- Irreducible infeasible subsystems of semidefinite systems
This page was built for publication: Analyzing Infeasible Mixed-Integer and Integer Linear Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427364)
