Pages that link to "Item:Q4887738"
From MaRDI portal
The following pages link to An optimal algorithm for the mixed Chinese postman problem (Q4887738):
Displaying 30 items.
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
- Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem (Q378087) (← links)
- The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game (Q477339) (← links)
- Uncertain multi-objective Chinese postman problem (Q780142) (← links)
- Lower bounds for the mixed capacitated arc routing problem (Q1040970) (← links)
- A new algorithm for the directed Chinese postman problem (Q1115814) (← links)
- The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem (Q1261382) (← links)
- Improved solutions for the Chinese postman problem on mixed networks (Q1304518) (← links)
- On the mixed Chinese postman problem (Q1319678) (← links)
- Modeling and solving several classes of arc routing problems as traveling salesman problems (Q1374032) (← links)
- Finding postal carrier walk paths in mixed graphs (Q1380723) (← links)
- A GRASP heuristic for the mixed Chinese postman problem (Q1847247) (← links)
- Algorithms for the Chinese postman problem on mixed networks (Q1894723) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- An algorithm for the hierarchical Chinese postman problem (Q1970425) (← links)
- An approximation algorithm for solving the heterogeneous Chinese postman problem (Q2151360) (← links)
- An integer programming approach for the Chinese postman problem with time-dependent travel time (Q2343981) (← links)
- Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems (Q2494509) (← 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)
- Approximation algorithms for multi-vehicle stacker crane problems (Q2687683) (← links)
- The time-dependent rural postman problem: polyhedral results (Q2867412) (← links)
- (Q3194237) (← links)
- (Q3216698) (← links)
- (Q4025748) (← links)
- An improved heuristic algorithm for the maximum benefit Chinese postman problem (Q5092514) (← links)
- Variants of the mixed postman problem solvable using linear programming (Q5248773) (← links)
- Approximate solutions for the maximum benefit chinese postman problem (Q5426612) (← links)
- Arc routing problems: A review of the past, present, and future (Q6087068) (← links)