Pages that link to "Item:Q1156692"
From MaRDI portal
The following pages link to Irreducibly inconsistent systems of linear inequalities (Q1156692):
Displaying 35 items.
- Fast, flexible MUS enumeration (Q272009) (← links)
- Preferential reducts and constructs in robust multiple criteria ranking and sorting (Q480786) (← links)
- Solution techniques for the large set covering problem (Q868387) (← links)
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation (Q992606) (← links)
- On optimal zero-preserving corrections for inconsistent linear systems (Q1041447) (← links)
- Diagnosing infeasibilities in network flow problems (Q1290604) (← 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)
- 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)
- Interactive group decision making procedure under incomplete information (Q1610174) (← links)
- A new model for automated examination timetabling (Q1761908) (← 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)
- Analyzing infeasible nonlinear programs (Q1804579) (← links)
- Resolving inconsistencies among constraints on the parameters of an MCDA model (Q1869532) (← links)
- Debugging unsatisfiable constraint models (Q2011577) (← 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)
- 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)
- Detecting IIS in infeasible linear programmes using techniques from goal programming (Q2563884) (← links)
- A New Approach to Partial MUS Enumeration (Q3453242) (← links)
- The AMPL Modeling Language: An Aid to Formulating and Solving Optimization Problems (Q3462307) (← links)
- INCONSISTENT STRUCTURES OF LINEAR SYSTEMS (Q4015788) (← links)
- Clingo goes linear constraints over reals and integers (Q4592712) (← links)
- Symmetry-driven network reconstruction through pseudobalanced coloring optimization (Q5101076) (← 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)
- Human-centred feasibility restoration in practice (Q6049434) (← links)