Pages that link to "Item:Q4354937"
From MaRDI portal
The following pages link to Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program (Q4354937):
Displaying 33 items.
- Preferential reducts and constructs in robust multiple criteria ranking and sorting (Q480786) (← links)
- Solution techniques for the large set covering problem (Q868387) (← links)
- HySAT: An efficient proof engine for bounded model checking of hybrid systems (Q883144) (← links)
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation (Q992606) (← links)
- A hybrid algorithm for solving linear inequalities in a least squares sense (Q1014358) (← links)
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449) (← links)
- On optimal zero-preserving corrections for inconsistent linear systems (Q1041447) (← links)
- Finding duplicate rows in a linear programming model (Q1090077) (← links)
- Some results concerning post-infeasibility analysis (Q1328606) (← links)
- Finding the minimum weight IIS cover of an infeasible system of linear inequalities (Q1380442) (← links)
- An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem (Q1380443) (← links)
- Optimization approaches to supervised classification (Q1753623) (← links)
- Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables (Q1754029) (← links)
- Harvey Greenberg: analyzing infeasible mathematical programs (Q2086522) (← links)
- Identifying relatively irreducible infeasible subsystems of linear inequalities (Q2241565) (← links)
- Automatic repair of convex optimization problems (Q2245690) (← links)
- Irreducible infeasible subsystems of semidefinite systems (Q2420811) (← links)
- Generalized filtering algorithms for infeasibility analysis (Q2459383) (← links)
- Infeasibility resolution based on goal programming (Q2459385) (← links)
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints (Q2459386) (← links)
- Efficient algorithms for finding critical subgraphs (Q2467361) (← links)
- Feasibility and infeasibility in optimization. Algorithms and computational methods. (Q2473296) (← links)
- Detecting IIS in infeasible linear programmes using techniques from goal programming (Q2563884) (← links)
- Valid cycles: A source of infeasibility in open shortest path first routing (Q3548721) (← links)
- Computer-assisted analysis for diagnosing infeasible or unbounded linear programs (Q3773689) (← links)
- Approaches to Diagnosing Infeasible Linear Programs (Q4015388) (← links)
- Identifying Minimally Infeasible Subsystems of Inequalities (Q4021366) (← links)
- Locating Minimal Infeasible Constraint Sets in Linear Programs (Q4025905) (← links)
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs (Q4427364) (← links)
- Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models (Q5131703) (← links)
- K-best feasible clusters - ranking optimal solutions from an infeasible LP (Q5882398) (← links)
- A fuzzy method to repair infeasibility in linearly constrained problems (Q5951740) (← links)
- Mathematical formulations for consistent travelling salesman problems (Q6555132) (← links)
