Integer programming approaches for minimum stabbing problems (Q5418014)
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: Integer programming approaches for minimum stabbing problems |
scientific article; zbMATH DE number 6298310
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Integer programming approaches for minimum stabbing problems |
scientific article; zbMATH DE number 6298310 |
Statements
Integer programming approaches for minimum stabbing problems (English)
0 references
26 May 2014
0 references
integer programming
0 references
Lagrangian relaxation
0 references
stabbing problems
0 references
branch-and-bound
0 references
branch-and-cut
0 references
0.87862945
0 references
0.8688243
0 references
0.86263895
0 references
0.85870373
0 references
0.85623085
0 references
0.8546659
0 references
0.8545948
0 references
