LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility (Q5301142): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:47, 8 February 2024
scientific article; zbMATH DE number 6182964
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility |
scientific article; zbMATH DE number 6182964 |
Statements
LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility (English)
0 references
2 July 2013
0 references
packing
0 references
branch-and-price
0 references
dimension reduction
0 references
interval graph
0 references
