Pages that link to "Item:Q4025905"
From MaRDI portal
The following pages link to Locating Minimal Infeasible Constraint Sets in Linear Programs (Q4025905):
Displaying 50 items.
- Extracting unsatisfiable cores for LTL via temporal resolution (Q266863) (← links)
- Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349) (← links)
- Feasibility in reverse convex mixed-integer programming (Q439456) (← links)
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata (Q479819) (← links)
- Preferential reducts and constructs in robust multiple criteria ranking and sorting (Q480786) (← links)
- Irreducible infeasible sets in convex mixed-integer programs (Q495724) (← links)
- Enhancing unsatisfiable cores for LTL with information on temporal relevance (Q507378) (← links)
- Coupling input-output analysis with multiobjective linear programming models for the study of economy-energy-environment-social (E3S) trade-offs: a review (Q513089) (← links)
- Extending linear relaxation for non-square matrices and soft constraints (Q738985) (← links)
- An interactive method of tackling uncertainty in interval multiple objective linear programming (Q844514) (← 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)
- A hybrid algorithm for solving linear inequalities in a least squares sense (Q1014358) (← links)
- A Benders approach for computing lower bounds for the mirrored traveling tournament problem (Q1015323) (← links)
- On optimal zero-preserving corrections for inconsistent linear systems (Q1041447) (← links)
- Finding duplicate rows in a linear programming model (Q1090077) (← links)
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← links)
- Diagnosing infeasibilities in network flow problems (Q1290604) (← links)
- On infeasibility of systems of convex analytic inequalities (Q1295897) (← links)
- Infeasibility analysis for systems of quadratic convex inequalities (Q1296129) (← links)
- MINOS(IIS): Infeasibility analysis using MINOS (Q1317084) (← links)
- Some results concerning post-infeasibility analysis (Q1328606) (← links)
- The use of the optimal partition in a linear programming solution for postoptimal analysis (Q1342079) (← links)
- Sensivitiy analysis for assessing preferentially independent order relations (Q1360123) (← links)
- Interactions between nonlinear programming and modeling systems (Q1365050) (← links)
- Formulation assistance for global optimization problems (Q1373158) (← links)
- Consistency, redundancy, and implied equalities in linear systems (Q1380438) (← 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)
- Reasoning on infeasibility in distributed collaborative computing environment (Q1380446) (← links)
- Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← links)
- Finding minimum stopping and trapping sets: an integer linear programming approach (Q1661914) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- On the choice of parameters in the residual method for the optimal correction of improper problems of convex optimization (Q1744991) (← links)
- Optimization approaches to supervised classification (Q1753623) (← links)
- Connections between the total least squares and the correction of an infeasible system of linear inequalities (Q1765915) (← links)
- A framework for optimal correction of inconsistent linear constraints (Q1774520) (← links)
- On exact selection of minimally unsatisfiable subformulae (Q1777390) (← links)
- Analyzing infeasible nonlinear programs (Q1804579) (← links)
- Harvey Greenberg: analyzing infeasible mathematical programs (Q2086522) (← links)
- Strengthening of feasibility cuts in logic-based benders decomposition (Q2117199) (← links)
- Identifying relatively irreducible infeasible subsystems of linear inequalities (Q2241565) (← links)
- Automatic repair of convex optimization problems (Q2245690) (← links)
- Feasible partition problem in reverse convex and convex mixed-integer programming (Q2256208) (← links)
- Minimal infeasible constraint sets in convex integer programs (Q2268936) (← links)
- Hildreth's algorithm with applications to soft constraints for user interface layout (Q2351069) (← links)
- Irreducible infeasible subsystems of semidefinite systems (Q2420811) (← links)
- Generalized filtering algorithms for infeasibility analysis (Q2459383) (← links)
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints (Q2459386) (← links)
