An optimality cut for mixed integer linear programs

DOI10.1016/S0377-2217(98)00357-9MaRDI QIDQ1809846zbMATH OpenFDO

Authors G. Laporte, F. Semet

Publication date 25 November 1999

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

Full work available at URL https://doi.org/10.1016/S0377-2217(98)00357-9

zbMATH Keywords

Gomory cutinteger programmingoptimality cutpenalty cut

Mathematics Subject Classification ID

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

Recommendations

• Strengthening Gomory Mixed-Integer Cuts
• Foundation-penalty cuts for mixed-integer programs.
• Classical cuts for mixed-integer programming and branch-and-cut
• Gomory cuts revisited
• Classical cuts for mixed-integer programming and branch-and-cut

Cites work

• Facet identification for the symmetric traveling salesman polytope
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1175944 (Why is no real title available?)
• scientific article; zbMATH DE number 3373541 (Why is no real title available?)
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Solution of a Large-Scale Traveling-Salesman Problem
• Solution of large-scale symmetric travelling salesman problems
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse

Cited in

(14)

• Foundation-penalty cuts for mixed-integer programs.
• Lift-and-project cuts for convex mixed integer nonlinear programs
• Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
• Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results
• Distances between optimal solutions of mixed-integer programs
• Ordered optimal solutions and parametric minimum cut problems
• Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
• On t-branch split cuts for mixed-integer programs
• A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
• scientific article; zbMATH DE number 5257230 (Why is no real title available?)
• Integer Programming and Combinatorial Optimization
• Classical cuts for mixed-integer programming and branch-and-cut
• An interior point cutting plane heuristic for mixed integer programming
• Testing cut generators for mixed-integer linear programming

Describes a project that uses

Uses Software

• NETGEN
• OR-Library
• CPLEX

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

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