Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618): 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.1016/j.artint.2006.02.005 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2103698736 / rank | |||
Normal rank |
Revision as of 21:19, 19 March 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