Two-phase branch-and-cut for the mixed capacitated general routing problem

DOI10.1016/j.ejor.2014.11.005zbMath1346.90219OpenAlexW2047495316MaRDI QIDQ319006

Francesca Vocaturo, Stefan Irnich, Demetrio Laganà, Claudia Schlebusch

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.11.005

zbMATH Keywords

integer programmingbranch-and-cut algorithmgeneral routing problemmixed graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (7)

Two-phase branch-and-cut for the mixed capacitated general routing problem ⋮ A dynamic multi-period general routing problem arising in postal service and parcel delivery systems ⋮ Optimally solving the joint order batching and picker routing problem ⋮ The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands ⋮ The periodic rural postman problem with irregular services on mixed graphs ⋮ The undirected capacitated general routing problem with profits ⋮ Branch-price-and-cut for the mixed capacitated general routing problem with time windows

Uses Software

• VRP
• CBMix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-phase branch-and-cut for the mixed capacitated general routing problem
• A lower bound for the node, edge, and arc routing problem
• Modeling and solving the mixed capacitated general routing problem
• Lower bounds for the mixed capacitated arc routing problem
• New inequalities for the general routing problem
• The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
• The capacitated arc routing problem: Valid inequalities and facets
• The mixed general routing polyhedron
• Recent advances in memetic algorithms.
• The general routing polyhedron: A unifying framework
• A cutting plane algorithm for the capacitated arc routing problem
• A capacitated general routing problem on mixed networks
• On the general routing polytope
• On the capacitated concentrator location problem: a reformulation by discretization
• Lower and upper bounds for the mixed capacitated arc routing problem
• Discretized formulations for capacitated location problems with modular distribution costs
• The Vehicle Routing Problem
• Vehicle Routing
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
• Odd Minimum Cut-Sets and b-Matchings
• On general routing problems
• A fundamental problem in vehicle routing
• Exact solution of the generalized routing problem through graph transformations
• An optimal algorithm for the mixed Chinese postman problem
• A Location Based Heuristic for General Routing Problems
• Arc Routing
• A branch & cut algorithm for the windy general routing problem and special cases
• New Results on the Mixed General Routing Problem
• A cutting plane algorithm for the general routing problem

This page was built for publication: Two-phase branch-and-cut for the mixed capacitated general routing problem