A Graph-Theoretic Approach to a Class of Integer-Programming Problems
From MaRDI portal
Publication:5575235
DOI10.1287/opre.17.6.1017zbMath0183.49006OpenAlexW2166703666MaRDI QIDQ5575235
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
Related Items (9)
Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs ⋮ Linear-Time Approximation for Maximum Weight Matching ⋮ An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ An analysis of the stable marriage assignment algorithm ⋮ On a general network location--production--allocation problem ⋮ Relations between graphs and integer-pair sequences ⋮ An algorithm for then×n optimum assignment problem ⋮ Stable sets in certain \(P_6\)-free graphs
This page was built for publication: A Graph-Theoretic Approach to a Class of Integer-Programming Problems
