An exact ceiling point algorithm for general integer linear programming
From MaRDI portal
Publication:4713421
DOI<53::AID-NAV3220380107>3.0.CO;2-D 10.1002/1520-6750(199102)38:1<53::AID-NAV3220380107>3.0.CO;2-DzbMath0783.90084OpenAlexW2064928250MaRDI QIDQ4713421
Frederick S. Hillier, Robert M. Saltzman
Publication date: 25 June 1992
Full work available at URL: https://doi.org/10.1002/1520-6750(199102)38:1<53::aid-nav3220380107>3.0.co;2-d
Integer programming (90C10) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (4)
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 ⋮ 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
Cites Work
This page was built for publication: An exact ceiling point algorithm for general integer linear programming
