The mixed general routing polyhedron
From MaRDI portal
Publication:1396827
DOI10.1007/s10107-003-0391-9zbMath1023.90072OpenAlexW2005068071MaRDI QIDQ1396827
José María Sanchis, Antonio Romero, Angel Corberán
Publication date: 13 July 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/100415
general routing problemrural postman problemroutingfacetspolyhedral combinatoricsarc routingmixed Chinese postman problem
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (15)
The mixed capacitated general routing problem under uncertainty ⋮ Two-phase branch-and-cut for the mixed capacitated general routing problem ⋮ Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem ⋮ Modeling and solving the mixed capacitated general routing problem ⋮ On path-bridge inequalities for the orienteering arc routing problems ⋮ The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm ⋮ An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation ⋮ Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems ⋮ Lower and upper bounds for the mixed capacitated arc routing problem ⋮ A comparison of two different formulations for arc routing problems on mixed graphs ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ On the distance-constrained close enough arc routing problem ⋮ Lower bounds for the mixed capacitated arc routing problem ⋮ An integer programming approach for the Chinese postman problem with time-dependent travel time ⋮ The time-dependent rural postman problem: polyhedral results
This page was built for publication: The mixed general routing polyhedron
