The Generalized Arc Routing Problem

This paper focuses on the generalized arc routing problem. This problem is stated on an undirected graph in which some clusters are defined as pairwise-disjoint connected subgraphs, and a route is sought that traverses at least one edge of each cluster. Broadly speaking, the generalized arc routing...

Full description

Saved in:

Bibliographic Details
Published in:	TOP Vol. 25; no. 3; pp. 497 - 525
Main Authors:	Aráoz, Julián, Fernández, Elena, Franquesa, Carles
Format:	Journal Article Publication
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2017 Springer Nature B.V Springer
Subjects:	90 Operations research, mathematical programming 90B Operations research and management science 90C Mathematical programming Arc routing Branch and cut Business and Management Classificació AMS Clusters CPLEX Economic Theory/Quantitative Economics/Mathematical Methods Economics Facets Finance Graph theory Industrial and Production Engineering Inequalities Insurance Investigació operativa Management Matemàtiques i estadística Mathematical programming Operations research Operations Research/Decision Theory Optimization Original Paper Polyhedral modeling Programació (Matemàtica) Programming (Mathematics) Routing Statistics for Business Traveling salesman problem TSP Valid inequalities Àrees temàtiques de la UPC TSP Arc routing 98B09 Operations research Polyhedral modeling Facets CPLEX Routing Valid inequalities Branch and cut Mathematical programming
ISSN:	1134-5764, 1863-8279
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!