A Heuristic Ceiling Point Algorithm for General Integer Linear Programming

DOI10.1287/MNSC.38.2.263MaRDI QIDQ4005805zbMATH OpenOpenAlexFDO

Authors Robert M. Saltzman, Frederick S. Hillier

Publication date 27 September 1992

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/7ff332a893a727d6b77a322b7917a8b6b4d54a38

zbMATH Keywords

heuristicallocationset coveringhyperplanefixed chargeceiling point

Mathematics Subject Classification ID

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

Recommendations

• An exact ceiling point algorithm for general integer linear programming
• A heuristic algorithm for solving integer linear programming problem and unveiling the applications
• General purpose heuristics for integer programming. I
• A computational study of an objective hyperplane search heuristic for the general integer linear programming problem
• A generalized Wedelin heuristic for integer programming
• A linear algorithm for integer programming in the plane
• General purpose heuristics for integer programming. II
• scientific article; zbMATH DE number 3847219
• scientific article; zbMATH DE number 3511865
• An approximate algorithm for nonlinear integer programming

Cited in

(12)

• Feasibility Pump-like heuristics for mixed integer problems
• An exact ceiling point algorithm for general integer linear programming
• Mathematical programming based heuristics for the 0--1 MIP: a survey
• Parametric formulation of the general integer linear programming problem
• A computational study of parametric tabu search for 0-1 mixed integer programs
• A binary-rounding heuristic for multi-period variable-task-duration assignment problems
• 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
• An interior point cutting plane heuristic for mixed integer programming
• Improving the feasibility pump
• A framework for constructing general integer problems with well-determined duality gaps
• General purpose heuristics for integer programming. II

Describes a project that uses

Uses Software

• GAMS

This page was built for publication: A Heuristic 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 Q4005805)