scientific article; zbMATH DE number 2134197

MaRDI QIDQ3159359zbMATH OpenFDO

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

Mathematics Subject Classification ID

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

Recommendations

• Maximally violated mod-\(p\) cuts for the capacitated vehicle-routing problem
• scientific article; zbMATH DE number 1234739
• scientific article; zbMATH DE number 5021774
• A branch-and-cut algorithm for vehicle routing problems
• Branch and cut methods for network optimization

Cited in

(13)

• A cutting plane algorithm for the general routing problem
• Branch and cut methods for network optimization
• A symmetry-free polynomial formulation of the capacitated vehicle routing problem
• Computing compatible tours for the symmetric traveling salesman problem
• A new ILP-based refinement heuristic for vehicle routing problems
• Computing finest mincut partitions of a graph and application to routing problems
• A compact transformation of arc routing problems into node routing problems
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Maximally violated mod-\(p\) cuts for the capacitated vehicle-routing problem
• Solving capacitated arc routing problems using a transformation to the CVRP
• scientific article; zbMATH DE number 91756 (Why is no real title available?)
• New benchmark instances for the capacitated vehicle routing problem
• Generating partitions of a graph into a fixed number of minimum weight cuts

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)