Branch-and-cut for combinatorial optimization problems without auxiliary binary variables (Q2775776): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s0269888901000030 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2139337114 / rank | |||
Normal rank | |||
Latest revision as of 10:22, 30 July 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
