Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (Q704117): 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.ejor.2003.09.024 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2025661878 / rank | |||
Normal rank |
Revision as of 01:51, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem |
scientific article |
Statements
Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (English)
0 references
12 January 2005
0 references
Peripatetic Salesman Problem
0 references
Traveling Salesman Problem
0 references
Branch-and-cut
0 references