Pages that link to "Item:Q1125619"
From MaRDI portal
The following pages link to On the membership problem for the elementary closure of a polyhedron (Q1125619):
Displaying 27 items.
- A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution (Q336705) (← links)
- On the membership problem for the \({0, 1/2}\)-closure (Q408382) (← links)
- Rank bounds for a hierarchy of Lovász and Schrijver (Q498445) (← links)
- A note on the MIR closure and basic relaxations of polyhedra (Q635512) (← links)
- MIR closures of polyhedral sets (Q847821) (← links)
- Optimizing over the first Chvátal closure (Q877190) (← links)
- The stable set polytope of quasi-line graphs (Q949780) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Totally tight Chvatal-Gomory cuts (Q1612006) (← links)
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts (Q1612007) (← links)
- Chvatal--Gomory--tier cuts for general integer programs (Q1779688) (← links)
- Generalized Chvátal-Gomory closures for integer programs with bounds on variables (Q2235152) (← links)
- Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
- On the rational polytopes with Chvátal rank 1 (Q2288183) (← links)
- MIPping closures: An instant survey (Q2373443) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- When the Gomory-chvátal closure coincides with the integer hull (Q2417111) (← links)
- Metric inequalities and the network loading problem (Q2471279) (← links)
- Projected Chvátal-Gomory cuts for mixed integer linear programs (Q2476991) (← links)
- Approximate fixed-rank closures of covering problems (Q2583148) (← links)
- On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure (Q2670463) (← links)
- Facet Generating Techniques (Q2971603) (← links)
- Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point (Q3186518) (← links)
- Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows (Q3564367) (← links)
- Elementary closures for integer programs. (Q5937498) (← links)
- Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows (Q6160235) (← links)
- A knapsack intersection hierarchy (Q6161286) (← links)
