The following pages link to (Q3023951):
Displaying 16 items.
- Some approaches to the solution of optimization problems in supervised learning (Q267571) (← links)
- Constructing patterns of (many) ESSs under support size control (Q831065) (← links)
- HySAT: An efficient proof engine for bounded model checking of hybrid systems (Q883144) (← links)
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions (Q943838) (← links)
- On the maximum feasible subsystem problem, IISs and IIS-hypergraphs (Q1396834) (← links)
- Automatic repair of convex optimization problems (Q2245690) (← links)
- Irreducible infeasible subsystems of semidefinite systems (Q2420811) (← links)
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem (Q2459384) (← links)
- Conflict analysis in mixed integer programming (Q2471271) (← links)
- Faster maximum feasible subsystem solutions for dense constraint matrices (Q2669801) (← links)
- Ambiguous incidences of unbounded polyhedra (Q2761100) (← links)
- A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set (Q5110557) (← links)
- Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices (Q5116482) (← links)
- Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices (Q5220475) (← links)
- The maximum feasible subset problem (maxFS) and applications (Q5884385) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)