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

DOI10.1287/opre.17.4.638zbMath0176.49904OpenAlexW2023224816MaRDI QIDQ5568936

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

Related Items (6)

A surrogate cutting plane algorithm for all-integer programming ⋮ 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 ⋮ Enumerative inequalities in integer programming ⋮ On the number of solutions to a Diophantine equation ⋮ An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem

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