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

DOI10.1016/J.AMC.2006.06.100zbMATH Open1120.90033OpenAlexW2002374099MaRDI QIDQ870164FDOQ870164

Authors: 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

Recommendations

• A computational study of an objective hyperplane search heuristic for the general integer linear programming problem
• scientific article
• An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem
• The stopped simplex algorithm for integer linear programs with special cuts
• A new implicit enumerative search for the solution to an integer linear program

zbMATH Keywords

linear programminginteger linear programmingsimplex methodbound-and-stopped algorithm

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• An Automatic Method of Solving Discrete Programming Problems
• Gomory cuts revisited
• Outline of an algorithm for integer solutions to linear programs
• DNA solution of integer linear programming
• Parametric formulation of the general integer linear programming problem
• Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
• Letter to the Editor—A Note on the Branch-and-Bound Principle
• Lagrangean Decomposition In Integer Linear Programming: A New Scheme
• 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
• The Accelerated Bound-and-Scan Algorithm for Integer Programming
• Title not available (Why is that?)

Cited In (6)

• An Isometric Surface Method For Integer Linear Programming * *Supported by the R&D base on advanced manufacturing technology, Academia Sinica
• A priori determination of bounds for the optimal value of variables in integer linear programming problems
• Finding minimum stopping and trapping sets: an integer linear programming approach
• A new implicit enumerative search for the solution to an integer linear program
• The stopped simplex algorithm for integer linear programs with special cuts
• Options strategies with the risk adjustment

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

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