An exact ceiling point algorithm for general integer linear programming

DOI10.1002/1520-6750(199102)38:1%3C53::AID-NAV3220380107%3E3.0.CO;2-DMaRDI QIDQ4713421zbMATH OpenOpenAlexFDO

Authors Robert M. Saltzman, Frederick S. Hillier

Publication date 25 June 1992

Full work available at URL https://doi.org/10.1002/1520-6750(199102)38:1%3C53::aid-nav3220380107%3E3.0.co;2-d

zbMATH Keywords

integer linear programmingexact ceiling point algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10)

Recommendations

• A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
• An algorithm of internal feasible directions for linear integer programming
• An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane
• scientific article; zbMATH DE number 14318
• scientific article; zbMATH DE number 3959128

Cited in

(5)

• Parametric formulation of the general integer linear programming problem
• A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
• An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem
• A computational study of an objective hyperplane search heuristic for the general integer linear programming problem
• A framework for constructing general integer problems with well-determined duality gaps

This page was built for publication: An exact ceiling point algorithm for general integer linear programming

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