A Graph-Theoretic Approach to a Class of Integer-Programming Problems

DOI10.1287/OPRE.17.6.1017MaRDI QIDQ5575235zbMATH OpenOpenAlexFDO

Authors J. F. Desler, S. Louis Hakimi

Publication date 1969

Published in Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

operations research

Cited in

(9)

• On a general network location--production--allocation problem
• Relations between graphs and integer-pair sequences
• Stable sets in certain \(P_6\)-free graphs
• An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
• Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
• Linear-time approximation for maximum weight matching
• An algorithm for then×n optimum assignment problem
• An analysis of the stable marriage assignment algorithm
• An introduction to the two‐dimensional rectangular cutting and packing problem

This page was built for publication: A Graph-Theoretic Approach to a Class of Integer-Programming Problems

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