An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane

DOI10.1016/j.amc.2006.06.100zbMath1120.90033OpenAlexW2002374099MaRDI QIDQ870164

Pei-Wang Gao

Publication date: 12 March 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.06.100

zbMATH Keywords

linear programmingsimplex methodinteger linear programmingbound-and-stopped algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (1)

Options strategies with the risk adjustment

Cites Work

• Unnamed Item
• Unnamed Item
• Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
• Cutting planes for integer programs with general integer variables
• A computational study of an objective hyperplane search heuristic for the general integer linear programming problem
• Parametric formulation of the general integer linear programming problem
• Gomory cuts revisited
• DNA solution of integer linear programming
• Outline of an algorithm for integer solutions to linear programs
• An Automatic Method of Solving Discrete Programming Problems
• Lagrangean Decomposition In Integer Linear Programming: A New Scheme
• The Accelerated Bound-and-Scan Algorithm for Integer Programming
• Letter to the Editor—A Note on the Branch-and-Bound Principle

This page was built for publication: An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane