scientific article; zbMATH DE number 2134197
From MaRDI portal
Publication:3159359
zbMATH Open1103.90394MaRDI QIDQ3159359FDOQ3159359
Authors: Klaus M. Wenger 
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 of this publication is not available (Why is that?)
Recommendations
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cited In (13)
- Maximally violated mod-\(p\) cuts for the capacitated vehicle-routing problem
- Computing compatible tours for the symmetric traveling salesman problem
- New benchmark instances for 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
- A cutting plane algorithm for the general routing problem
- A symmetry-free polynomial formulation of the capacitated vehicle routing problem
- A new ILP-based refinement heuristic for vehicle routing problems
- Branch and cut methods for network optimization
- Title not available (Why is that?)
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Solving capacitated arc routing problems using a transformation to the CVRP
- A compact transformation of arc routing problems into node routing problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3159359)
