Pages that link to "Item:Q4025905"
From MaRDI portal
The following pages link to Locating Minimal Infeasible Constraint Sets in Linear Programs (Q4025905):
Displaying 26 items.
- Algorithms for computing minimal unsatisfiable subsets of constraints (Q2471741) (← links)
- Detecting IIS in infeasible linear programmes using techniques from goal programming (Q2563884) (← links)
- Guided design search in the interval-bounded sailor assignment problem (Q2581609) (← links)
- Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling (Q2676319) (← links)
- Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae (Q2741521) (← links)
- MCS Extraction with Sublinear Oracle Queries (Q2818026) (← links)
- Efficient Reasoning for Inconsistent Horn Formulae (Q2835881) (← links)
- Computing a Pareto-optimal solution for multi-objective flexible linear programming in a bipolar framework (Q2943490) (← links)
- On Improving MUS Extraction Algorithms (Q3007681) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- A New Approach to Partial MUS Enumeration (Q3453242) (← links)
- The AMPL Modeling Language: An Aid to Formulating and Solving Optimization Problems (Q3462307) (← links)
- Computer-assisted analysis for diagnosing infeasible or unbounded linear programs (Q3773689) (← links)
- (Q4005863) (← links)
- Approaches to Diagnosing Infeasible Linear Programs (Q4015388) (← links)
- Identifying Minimally Infeasible Subsystems of Inequalities (Q4021366) (← links)
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program (Q4354937) (← links)
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs (Q4427364) (← links)
- ASP modulo CSP: The clingcon system (Q4911129) (← links)
- Conflict Analysis for MINLP (Q4995080) (← links)
- Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores (Q5015593) (← links)
- Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models (Q5131703) (← links)
- On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem (Q5191123) (← links)
- K-best feasible clusters - ranking optimal solutions from an infeasible LP (Q5882398) (← links)
- Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition (Q6081826) (← links)
- Diagnosing infeasible optimization problems using large language models (Q6655267) (← links)