The capacitated arc routing problem: Valid inequalities and facets
From MaRDI portal
Publication:1384095
DOI10.1023/A:1018316919294zbMath0895.90083MaRDI QIDQ1384095
José-Manuel Belenguer, Enrique Benavent
Publication date: 13 April 1998
Published in: Computational Optimization and Applications (Search for Journal in Brave)
integer programminggeneralized assignment problemvalid inequalitiesroutingfacetpolyhedral combinatoricscapacitated arc routingarc routing problems
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items
A guided local search heuristic for the capacitated arc routing problem, A polyhedral approach to the rural postman problem, Two-phase branch-and-cut for the mixed capacitated general routing problem, A branch-and-cut algorithm for the profitable windy rural postman problem, The capacitated arc routing problem with refill points, On the collaboration uncapacitated arc routing problem, Routing problems: A bibliography, Modeling and solving the mixed capacitated general routing problem, Multi-depot rural postman problems, Optimally solving the joint order batching and picker routing problem, The generalized arc routing problem, A Survey of the Generalized Assignment Problem and Its Applications, A generic exact solver for vehicle routing and related problems, Improved lower bounds and exact algorithm for the capacitated arc routing problem, The capacitated arc routing problem with intermediate facilities, The periodic rural postman problem with irregular services on mixed graphs, A Decade of Capacitated Arc Routing, A variable neighborhood search for the capacitated arc routing problem with intermediate facilities, Solving an urban waste collection problem using ants heuristics, The Steiner traveling salesman problem and its extensions, An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem, Min-Max K -vehicles windy rural postman problem, Recent results on Arc Routing Problems: An annotated bibliography, Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem, Exploiting sparsity in pricing routines for the capacitated arc routing problem, Lower bounds for the mixed capacitated arc routing problem, Solving the prize-collecting rural postman problem, A survey of models and algorithms for winter road maintenance. I: System design for spreading and plowing, The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra, A scatter search for the periodic capacitated arc routing problem, Solving capacitated arc routing problems using a transformation to the CVRP, A cutting plane algorithm for the capacitated arc routing problem
