Branch-and-cut for combinatorial optimization problems without auxiliary binary variables (Q2775776): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:41, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-cut for combinatorial optimization problems without auxiliary binary variables |
scientific article |
Statements
Branch-and-cut for combinatorial optimization problems without auxiliary binary variables (English)
0 references
2001
0 references
fibre optic cables
0 references
production scheduling
0 references
