An Integer Programming Approach to the Bandwidth Packing Problem (Q4363676)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1085202
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Integer Programming Approach to the Bandwidth Packing Problem |
scientific article; zbMATH DE number 1085202 |
Statements
An Integer Programming Approach to the Bandwidth Packing Problem (English)
0 references
12 November 1997
0 references
polyhedral cuts
0 references
branch-and-cut
0 references
bandwidth packing
0 references
arc-capacitated network
0 references
branch-and-bound
0 references
0.8533496856689453
0 references
0.834234893321991
0 references
0.816125214099884
0 references
0.8150564432144165
0 references
0.8020387887954712
0 references
