Pages that link to "Item:Q1396834"

The following pages link to On the maximum feasible subsystem problem, IISs and IIS-hypergraphs (Q1396834):

Displaying 21 items.

• Exact computation of max weighted score estimators (Q295700) (← links)
• Irreducible infeasible sets in convex mixed-integer programs (Q495724) (← 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)
• Optimization approaches to supervised classification (Q1753623) (← links)
• Maximum feasible subsystems of distance geometry constraints (Q2131137) (← links)
• Identifying relatively irreducible infeasible subsystems of linear inequalities (Q2241565) (← links)
• Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
• Irreducible infeasible subsystems of semidefinite systems (Q2420811) (← links)
• 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)
• A note on the selection of Benders' cuts (Q2638375) (← links)
• Vertex-facet incidences of unbounded polyhedra (Q2725173) (← links)
• A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set (Q5110557) (← links)
• Error correction for massive datasets (Q5317751) (← links)
• Generating all vertices of a polyhedron is hard (Q5920505) (← links)
• The MaxSAT problem in the real-valued MV-algebra (Q6541163) (← links)
• Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)