scientific article; zbMATH DE number 1568941
From MaRDI portal
Publication:4762468
zbMath0982.90008MaRDI QIDQ4762468
Enrique Benavent, José María Sanchis, Angel Corberán
Publication date: 22 February 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (20)
A guided local search heuristic for the capacitated arc routing 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 ⋮ Lower bounds and heuristics for the windy rural postman problem ⋮ On the collaboration uncapacitated arc 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 ⋮ The generalized arc routing problem ⋮ Fast upper and lower bounds for a large‐scale real‐world arc routing problem ⋮ A Decade of Capacitated Arc Routing ⋮ Computing finest mincut partitions of a graph and application to routing problems ⋮ The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm ⋮ The directed profitable rural postman problem with incompatibility constraints ⋮ An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem ⋮ Lower and upper bounds for the mixed capacitated arc routing problem ⋮ A comparison of two different formulations for arc routing problems on mixed graphs ⋮ Privatized rural postman problems ⋮ Solving the prize-collecting rural postman problem ⋮ A GRASP heuristic for the mixed Chinese postman problem ⋮ A cutting plane algorithm for the capacitated arc routing problem
This page was built for publication:
