scientific article
From MaRDI portal
Publication:3274590
zbMath0096.14505MaRDI QIDQ3274590
Publication date: 1960
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Rank of random half-integral polytopes — extended abstract —, Further results on the probabilistic traveling salesman problem, Column basis reduction and decomposable knapsack problems, A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution, On optimizing over lift-and-project closures, An abstract model for branch-and-cut, Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank, Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube, Random half-integral polytopes, Foundation-penalty cuts for mixed-integer programs., Facet Generating Techniques, A note on the split rank of intersection cuts, On the facet defining inequalities of the mixed-integer bilinear covering set, Chvátal closures for mixed integer programming problems, Constraint Integer Programming: A New Approach to Integrate CP and MIP, Cutting Planes and the Parameter Cutwidth, Cutting planes and the parameter cutwidth, Cutting planes in integer and mixed integer programming, Branch and cut methods for network optimization, Elementary closures for integer programs., Application of optimization methods to the hematological support of patients with disseminated malignancies, Polyhedral annexation in mixed integer and combinatorial programming, 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, SCIP: solving constraint integer programs, 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, Combinatorial optimization: current successes and directions for the future, Cutting planes in combinatorics, Recursive branch and bound
