The merchant subtour problem

DOI10.1007/s10107-002-0321-2zbMath1030.90104OpenAlexW2138087342MaRDI QIDQ1411616

Bram Verweij, Karen Aardal

Publication date: 29 October 2003

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/18997

zbMATH Keywords

mod-\(k\) cutsbranch-and-bound treebranch-and-prince-and-cut algorithmlifted cycle inequalitieslifted knapsack inequalitiestabu-search algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (2)

A stabilized column generation scheme for the traveling salesman subtour problem ⋮ Genetic algorithm for combinatorial path planning: the subtour problem

This page was built for publication: The merchant subtour problem