scientific article
From MaRDI portal
Publication:3159359
zbMath1103.90394MaRDI QIDQ3159359
Publication date: 16 February 2005
Full work available at URL: http://www.shaker.de/de/content/catalogue/index.asp?lang=de&ID=8&ISBN=978-3-8322-2545-2
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (9)
A symmetry-free polynomial formulation of the capacitated vehicle routing problem ⋮ Generating partitions of a graph into a fixed number of minimum weight cuts ⋮ Computing finest mincut partitions of a graph and application to routing problems ⋮ New benchmark instances for the capacitated vehicle routing problem ⋮ Computing compatible tours for the symmetric traveling salesman problem ⋮ Robust branch-and-cut-and-price for the capacitated vehicle routing problem ⋮ A compact transformation of arc routing problems into node routing problems ⋮ Solving capacitated arc routing problems using a transformation to the CVRP ⋮ A new ILP-based refinement heuristic for vehicle routing problems
This page was built for publication:
