Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables (Q2775776)
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: Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables |
scientific article; zbMATH DE number 1714034
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables |
scientific article; zbMATH DE number 1714034 |
Statements
2001
0 references
fibre optic cables
0 references
production scheduling
0 references
Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables (English)
0 references
