Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Concorde / rank | |||
Normal rank | |||
Revision as of 00:58, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cut-and-solve: An iterative search strategy for combinatorial optimization problems |
scientific article |
Statements
Cut-and-solve: An iterative search strategy for combinatorial optimization problems (English)
0 references
23 October 2007
0 references
search strategies
0 references
branch-and-bound
0 references
branch-and-cut
0 references
anytime algorithms
0 references
linear programming
0 references
traveling Salesman problem
0 references
