Modeling and solving the mixed capacitated general routing problem
From MaRDI portal
Publication:375984
DOI10.1007/S11590-012-0552-YzbMATH Open1280.90008OpenAlexW2083681781MaRDI QIDQ375984FDOQ375984
Roberto Musmanno, Adamo Bosco, Demetrio Laganà, Francesca Vocaturo
Publication date: 1 November 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0552-y
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A fundamental problem in vehicle routing
- The feasibility pump
- The vehicle routing problem. Latest advances and new challenges.
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A capacitated general routing problem on mixed networks
- Recent results on Arc Routing Problems: An annotated bibliography
- On general routing problems
- 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
- The general routing polyhedron: A unifying framework
- A cutting plane algorithm for the capacitated arc routing problem
- Lower and upper bounds for the mixed capacitated arc routing problem
- The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
- Odd Minimum Cut-Sets and b-Matchings
- 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
- An improved heuristic for the capacitated arc routing problem
- Transforming arc routing into node routing problems
Cited In (21)
- The mixed capacitated general routing problem under uncertainty
- Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm
- 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
- A transformation for the mixed general routing problem with turn penalties
- An efficiency-based path-scanning heuristic for the capacitated arc routing problem
- An updated annotated bibliography on arc routing problems
- Arc routing problems: A review of the past, present, and future
- Title not available (Why is that?)
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- Optimally solving the joint order batching and picker routing problem
- Ten years of feasibility pump, and counting
- The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands
- The undirected capacitated general routing problem with profits
- The bi-objective mixed capacitated general routing problem with different route balance criteria
- A dynamic multi-period general routing problem arising in postal service and parcel delivery systems
- Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs
- A parameterized lower bounding method for the open capacitated arc routing problem
- Title not available (Why is that?)
- Combined route capacity and route length models for unit demand vehicle routing problems
- The path restoration version of the spare capacity allocation problem with modularity restrictions: models, algorithms, and an empirical analysis
Uses Software
This page was built for publication: Modeling and solving 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 Q375984)
