A Graph-Theoretic Equivalence for Integer Programs

DOI10.1287/OPRE.21.1.261MaRDI QIDQ5679925zbMATH OpenOpenAlexFDO

Authors Jean-Claude Picard, H. Donald Ratliff

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

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

Cited in

(10)

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

This page was built for publication: A Graph-Theoretic Equivalence for Integer Programs

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