An optimality cut for mixed integer linear programs

DOI10.1016/S0377-2217(98)00357-9zbMath0938.90053MaRDI QIDQ1809846

Gilbert Laporte, Frédéric Semet

Publication date: 25 November 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

integer programmingGomory cutoptimality cutpenalty cut

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05)

Uses Software

• CPLEX
• OR-Library
• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Solution of large-scale symmetric travelling salesman problems
• Facet identification for the symmetric traveling salesman polytope
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Solution of a Large-Scale Traveling-Salesman Problem

This page was built for publication: An optimality cut for mixed integer linear programs