The following pages link to (Q4762468):
Displaying 25 items.
- Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
- A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108) (← links)
- On the collaboration uncapacitated arc routing problem (Q342264) (← links)
- Modeling and solving the mixed capacitated general routing problem (Q375984) (← links)
- Lower bounds and heuristics for the windy rural postman problem (Q852946) (← links)
- Solving the prize-collecting rural postman problem (Q1041930) (← links)
- The generalized arc routing problem (Q1688441) (← links)
- Arc-based integer programming formulations for three variants of proportional symbol maps (Q1751132) (← links)
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm (Q1752763) (← links)
- The directed profitable rural postman problem with incompatibility constraints (Q1753601) (← links)
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem (Q1761166) (← links)
- A GRASP heuristic for the mixed Chinese postman problem (Q1847247) (← links)
- A cutting plane algorithm for the capacitated arc routing problem (Q1870825) (← links)
- A guided local search heuristic for the capacitated arc routing problem (Q1873009) (← links)
- Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem (Q2162526) (← links)
- Computing finest mincut partitions of a graph and application to routing problems (Q2473036) (← links)
- Lower and upper bounds for the mixed capacitated arc routing problem (Q2496039) (← links)
- A comparison of two different formulations for arc routing problems on mixed graphs (Q2496040) (← links)
- Privatized rural postman problems (Q2496044) (← links)
- Integer linear programming models for global routing (Q2892279) (← links)
- A Decade of Capacitated Arc Routing (Q3564348) (← links)
- (Q4762467) (← links)
- (Q5271451) (← links)
- Fast upper and lower bounds for a large‐scale real‐world arc routing problem (Q6179706) (← links)
- Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem (Q6551080) (← links)
