A Heuristic Ceiling Point Algorithm for General Integer Linear Programming

DOI10.1287/mnsc.38.2.263zbMath0777.90035OpenAlexW2052800869MaRDI QIDQ4005805

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

hyperplaneheuristicset coveringallocationfixed chargeceiling point

Mathematics Subject Classification ID

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

Related Items

A computational study of an objective hyperplane search heuristic for the general integer linear programming problem, Mathematical programming based heuristics for the 0--1 MIP: a survey, A binary-rounding heuristic for multi-period variable-task-duration assignment problems, Parametric formulation of the general integer linear programming problem, An interior point cutting plane heuristic for mixed integer programming, Feasibility Pump-like heuristics for mixed integer problems, Improving the feasibility pump, A computational study of parametric tabu search for 0-1 mixed integer programs, A framework for constructing general integer problems with well-determined duality gaps, An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem

Uses Software

• GAMS