Pages that link to "Item:Q1396834"
From MaRDI portal
The following pages link to On the maximum feasible subsystem problem, IISs and IIS-hypergraphs (Q1396834):
Displayed 8 items.
- Repairing MIP infeasibility through local branching (Q2459381) (← links)
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem (Q2459384) (← 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)
- Conflict analysis in mixed integer programming (Q2471271) (← links)
- Vertex-facet incidences of unbounded polyhedra (Q2725173) (← links)
- Error correction for massive datasets (Q5317751) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)