Optimizing over the First Chvàtal Closure

DOI10.1007/11496915_2MaRDI QIDQ3596349zbMATH OpenOpenAlexFDO

Authors Matteo Fischetti, Andrea Lodi

Publication date 30 August 2007

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11496915_2

zbMATH Keywords

Chvàtal-Gomory cutscomputational analysisInteger Programsseparation problems

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Optimizing over the first Chvátal closure
• Optimizing over the split closure
• Projected Chvátal-Gomory cuts for mixed integer linear programs
• scientific article; zbMATH DE number 1342122
• Automatic integer programming reformulation using variable neighborhood search

Cited in

(10)

• MIPping closures: An instant survey
• Optimizing over the split closure
• Projected Chvátal-Gomory cuts for mixed integer linear programs
• Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
• Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
• Chvàtal-Gomory rank-1 cuts used in a Dantzig-Wolfe decomposition of the vehicle routing problem with time windows
• Mixed-integer cuts from cyclic groups
• Optimizing over the first Chvátal closure
• The mixing-MIR set with divisible capacities
• Valid inequalities for mixed integer linear programs

Describes a project that uses

Uses Software

• MIPLIB
• CPLEX
• PORTA

This page was built for publication: Optimizing over the First Chvàtal Closure

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