All-integer linear programming — a new approach via dynamic programming

DOI10.1002/nav.3800250305zbMath0402.90068OpenAlexW2076475306MaRDI QIDQ4187584

Mary W. Cooper, Leon Cooper

Publication date: 1978

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800250305

zbMATH Keywords

Dynamic ProgrammingComputational StudyAll-Integer Linear Programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Dynamic programming (90C39)

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 ⋮ Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem ⋮ An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem

This page was built for publication: All-integer linear programming — a new approach via dynamic programming