A Bound-and-Scan Algorithm for Pure Integer Linear Programming with General Variables

DOI10.1287/OPRE.17.4.638MaRDI QIDQ5568936zbMATH OpenOpenAlexFDO

Authors Frederick S. Hillier

Publication date 1969

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.17.4.638

zbMATH Keywords

operations research

Cited in

(6)

• A surrogate cutting plane algorithm for all-integer 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
• Parametric formulation of the general integer linear programming problem
• On the number of solutions to a Diophantine equation
• Enumerative inequalities in integer programming

This page was built for publication: A Bound-and-Scan Algorithm for Pure Integer Linear Programming with General Variables

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