scientific article; zbMATH DE number 3156817

Cited in

(35)

Tight rank lower bounds for the Sherali-Adams proof system
Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
Cutting planes in combinatorics
Application of optimization methods to the hematological support of patients with disseminated malignancies
Foundation-penalty cuts for mixed-integer programs.
Combinatorial optimization: current successes and directions for the future
Chvatal--Gomory--tier cuts for general integer programs
A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set
An abstract model for branch-and-cut
On the facet defining inequalities of the mixed-integer bilinear covering set
Further results on the probabilistic traveling salesman problem
On optimizing over lift-and-project closures
Rank of random half-integral polytopes. Extended abstract
Facet generating techniques
A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution
Cutting planes and the parameter cutwidth
Recursive branch and bound
Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank
Polyhedral annexation in mixed integer and combinatorial programming
Constraint Integer Programming: A New Approach to Integrate CP and MIP
Branch and cut methods for network optimization
Elementary closures for integer programs.
Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube
Random half-integral polytopes
A note on the split rank of intersection cuts
Proof complexity and the binary encoding of combinatorial principles
Learning to optimize: a tutorial for continuous and mixed-integer optimization
Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints
Jacques Benders and his decomposition algorithm
Cutting planes and the parameter cutwidth
Cutting planes in integer and mixed integer programming
SCIP: solving constraint integer programs
The strength of root cuts in an extended abstract branch-and-cut model
Column basis reduction and decomposable knapsack problems
Chvátal closures for mixed integer programming problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3274590)