On disjunctive cuts for combinatorial optimization (Q5952319): Difference between revisions
From MaRDI portal
Created a new Item |
Add wikidata item. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1011493126498 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1578768378 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57702383 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:40, 12 December 2024
scientific article; zbMATH DE number 1688724
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On disjunctive cuts for combinatorial optimization |
scientific article; zbMATH DE number 1688724 |
Statements
On disjunctive cuts for combinatorial optimization (English)
0 references
2001
0 references
integer programming
0 references
cutting planes
0 references
max-cut problem
0 references
asymmetric travelling salesman problem
0 references
set covering problem
0 references
