LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility (Q5301142): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/opre.1120.1150 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.1120.1150 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1964951253 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/OPRE.1120.1150 / rank | |||
Normal rank | |||
Latest revision as of 16:38, 30 December 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
