Pages that link to "Item:Q4021366"
From MaRDI portal
The following pages link to Identifying Minimally Infeasible Subsystems of Inequalities (Q4021366):
Displaying 42 items.
- Fast, flexible MUS enumeration (Q272009) (← links)
- Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints (Q291063) (← links)
- Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures (Q336468) (← links)
- Constraint classification in mathematical programming (Q689150) (← 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)
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449) (← links)
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← 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)
- Sensivitiy analysis for assessing preferentially independent order relations (Q1360123) (← 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)
- Complexity of minimum irreducible infeasible subsystem covers for flow networks (Q1752598) (← links)
- On exact selection of minimally unsatisfiable subformulae (Q1777390) (← links)
- Analyzing infeasible nonlinear programs (Q1804579) (← links)
- The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT) (Q1991143) (← links)
- Debugging unsatisfiable constraint models (Q2011577) (← links)
- Refined cut selection for Benders decomposition: applied to network capacity expansion problems (Q2074837) (← links)
- Shattering inequalities for learning optimal decision trees (Q2170186) (← links)
- Block-sparse recovery of semidefinite systems and generalized null space conditions (Q2197151) (← links)
- Identifying relatively irreducible infeasible subsystems of linear inequalities (Q2241565) (← links)
- Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
- An algorithm for binary linear chance-constrained problems using IIS (Q2419523) (← links)
- Irreducible infeasible subsystems of semidefinite systems (Q2420811) (← links)
- Repairing MIP infeasibility through local branching (Q2459381) (← links)
- Generalized filtering algorithms for infeasibility analysis (Q2459383) (← links)
- Detecting IIS in infeasible linear programmes using techniques from goal programming (Q2563884) (← links)
- A note on the selection of Benders' cuts (Q2638375) (← links)
- Conflict Analysis for MINLP (Q4995080) (← links)
- Stoichiometric and Constraint-Based Analysis of Biochemical Reaction Networks (Q5256764) (← links)
- K-best feasible clusters - ranking optimal solutions from an infeasible LP (Q5882398) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)
- Human-centred feasibility restoration in practice (Q6049434) (← links)
- Convex representation of metabolic networks with Michaelis-Menten kinetics (Q6540660) (← links)
- Optimal multivariate decision trees (Q6541864) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
- Diagnosing infeasible optimization problems using large language models (Q6655267) (← links)
