Modeling and solving the mixed capacitated general routing problem
type: Item
instance of: scholarly article
title: Modeling and solving the mixed capacitated general routing problem
zbMATH Open document ID: 1280.90008
author: Adamo Bosco
author: Demetrio Laganà
author: Roberto Musmanno
author: Francesca Vocaturo
published in: Optimization Letters
publication date: 2013-11-01T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6221906
zbMATH Keywords: routing problem
zbMATH Keywords: mixed graph
zbMATH Keywords: relaxation
zbMATH Keywords: separation algorithm
describes a project that uses: FEASPUMP
describes a project that uses: CBMix
MaRDI profile type: Publication
full work available at URL: s11590-012-0552-y
OpenAlex ID: W2083681781
cites work: The capacitated arc routing problem: Valid inequalities and facets
cites work: A cutting plane algorithm for the capacitated arc routing problem
cites work: Lower and upper bounds for the mixed capacitated arc routing problem
cites work: Q4762468
cites work: A cutting plane algorithm for the general routing problem
cites work: New Results on the Mixed General Routing Problem
cites work: A branch & cut algorithm for the windy general routing problem and special cases
cites work: The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
cites work: Recent results on Arc Routing Problems: An annotated bibliography
cites work: The mixed general routing polyhedron
cites work: The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
cites work: Q4510100
cites work: The feasibility pump
cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
cites work: The vehicle routing problem. Latest advances and new challenges.
cites work: Lower bounds for the mixed capacitated arc routing problem
cites work: Q4821580
cites work: On general routing problems
cites work: New inequalities for the general routing problem
cites work: The general routing polyhedron: A unifying framework
cites work: A fundamental problem in vehicle routing
cites work: Odd Minimum Cut-Sets and b-Matchings
cites work: A capacitated general routing problem on mixed networks
cites work: Transforming arc routing into node routing problems
cites work: An improved heuristic for the capacitated arc routing problem
DOI: 10.1007/S11590-012-0552-Y
description: scientific article; zbMATH DE number 6221906