The following pages link to (Q3274590):
Displaying 33 items.
- A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution (Q336705) (← links)
- Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank (Q408442) (← links)
- Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube (Q635513) (← links)
- Random half-integral polytopes (Q635514) (← links)
- A note on the split rank of intersection cuts (Q647399) (← links)
- Cutting planes and the parameter cutwidth (Q693047) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Column basis reduction and decomposable knapsack problems (Q834182) (← links)
- Chvátal closures for mixed integer programming problems (Q922950) (← links)
- Tight rank lower bounds for the Sherali-Adams proof system (Q1019183) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Cutting planes in combinatorics (Q1068092) (← links)
- Application of optimization methods to the hematological support of patients with disseminated malignancies (Q1220440) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- Combinatorial optimization: current successes and directions for the future (Q1593834) (← links)
- Chvatal--Gomory--tier cuts for general integer programs (Q1779688) (← links)
- A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set (Q1785240) (← links)
- An abstract model for branch-and-cut (Q2164714) (← links)
- On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
- Further results on the probabilistic traveling salesman problem (Q2368298) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- Rank of random half-integral polytopes — extended abstract — (Q2883588) (← links)
- Facet Generating Techniques (Q2971603) (← links)
- Cutting Planes and the Parameter Cutwidth (Q3576046) (← links)
- Recursive branch and bound (Q3693268) (← links)
- Polyhedral annexation in mixed integer and combinatorial programming (Q4139972) (← links)
- Constraint Integer Programming: A New Approach to Integrate CP and MIP (Q5387617) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)
- Elementary closures for integer programs. (Q5937498) (← links)
- Proof complexity and the binary encoding of combinatorial principles (Q6562831) (← links)
- Learning to optimize: a tutorial for continuous and mixed-integer optimization (Q6564763) (← links)
- Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints (Q6606248) (← links)
