A Graph-Theoretic Equivalence for Integer Programs

DOI10.1287/opre.21.1.261zbMath0263.90021OpenAlexW2130662965MaRDI QIDQ5679925

H. Donald Ratliff, Jean-Claude Picard

Publication date: 1973

Published in: Operations Research (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Related Items

A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization, 0-1 Quadratic programming approach for optimum solutions of two scheduling problems, An improved formulation for the inventory routing problem with time-varying demands, Balancing signed graphs, A new modeling and solution approach for the set-partitioning problem, The generalized vertex cover problem and some variations, An exact approach for cyclic inbound inventory routing in a level production system, Strong lower bounds for the prize collecting Steiner problem in graphs, A constrained nonlinear 0-1 program for data allocation, Unconstrained quadratic bivalent programming problem