Pages that link to "Item:Q3083283"
From MaRDI portal
The following pages link to On the Complexity of Selecting Disjunctions in Integer Programming (Q3083283):
Displaying 10 items.
- Improved branching disjunctions for branch-and-bound: an analytic center approach (Q319920) (← links)
- Achieving MILP feasibility quickly using general disjunctions (Q336442) (← links)
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← links)
- Thinner is not always better: cascade knapsack problems (Q1727953) (← links)
- Could we use a million cores to solve an integer program? (Q1935943) (← links)
- On the rational polytopes with Chvátal rank 1 (Q2288183) (← links)
- When the Gomory-chvátal closure coincides with the integer hull (Q2417111) (← links)
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube (Q2419579) (← links)
- Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point (Q3186518) (← links)
- A Unified Framework for Multistage Mixed Integer Linear Optimization (Q5014640) (← links)
