Branch-and-cut for combinatorial optimization problems without auxiliary binary variables (Q2775776): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Ismael Regis jun. de Farias / rank | |||
| Property / author | |||
| Property / author: Ellis L. Johnson / rank | |||
| Property / author | |||
| Property / author: Ismael Regis jun. de Farias / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Ellis L. Johnson / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:25, 5 March 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
