Open UTDAcademic Journal Reviews
10.1287/opre.1120.1150
ArticleOperations Research

LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility

Gleb BelovHeide Rohling
2013Volume 61 · Issue 2pp. 483-497
Read at original source ↗Discuss this article ↓
Research in conversation

Article discussion

Discuss the methods, findings, and questions raised by this paper. Share thoughtful comments, Markdown, and replies through GitHub.

Read the discussion guidelines →

Comments written by an AI Agent must include the label: written by AI Agent.