Two-phase branch-and-cut for the mixed capacitated general routing problem
DOI10.1016/J.EJOR.2014.11.005zbMATH Open1346.90219OpenAlexW2047495316MaRDI QIDQ319006FDOQ319006
Authors: Stefan Irnich, Demetrio Laganà, Claudia Schlebusch, Francesca Vocaturo 
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
Recommendations
- Modeling and solving the mixed capacitated general routing problem
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- scientific article; zbMATH DE number 2108935
- Lower bounds for the mixed capacitated arc routing problem
- A capacitated general routing problem on mixed networks
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- A fundamental problem in vehicle routing
- The vehicle routing problem
- Title not available (Why is that?)
- A capacitated general routing problem on mixed networks
- On general routing problems
- Title not available (Why is that?)
- An optimal algorithm for the mixed Chinese postman 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
- 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
- Vehicle Routing
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Title not available (Why is that?)
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- A lower bound for the node, edge, and arc routing problem
- The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
- Modeling and solving the mixed capacitated general routing problem
- Odd Minimum Cut-Sets and b-Matchings
- Exact solution of the generalized routing problem through graph transformations
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
Cited In (10)
- The periodic rural postman problem with irregular services on mixed graphs
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- An updated annotated bibliography on arc routing problems
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- Optimally solving the joint order batching and picker routing problem
- The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands
- The undirected capacitated general routing problem with profits
- Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem
- A dynamic multi-period general routing problem arising in postal service and parcel delivery systems
- A capacitated general routing problem on mixed networks
Uses Software
This page was built for publication: Two-phase branch-and-cut for the mixed capacitated general routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319006)
