LP bounds in an interval-graph algorithm for orthogonal-packing feasibility (Q5301142)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: LP bounds in an interval-graph algorithm for orthogonal-packing feasibility |
scientific article; zbMATH DE number 6182964
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8751676082611084
0 references
0.8353361487388611
0 references
0.8141671419143677
0 references
0.8090465068817139
0 references
