Pages that link to "Item:Q4849324"
From MaRDI portal
The following pages link to Arc Routing Problems, Part I: The Chinese Postman Problem (Q4849324):
Displaying 50 items.
- Heuristics for routes generation in pickup and delivery problem (Q300807) (← links)
- Parameterized complexity of the \(k\)-arc Chinese postman problem (Q340562) (← links)
- An analysis of the extended Christofides heuristic for the \(k\)-depot TSP (Q635520) (← links)
- The robot cleans up (Q849139) (← links)
- A survey of models and algorithms for winter road maintenance. III: Vehicle routing and depot location for spreading (Q850321) (← links)
- A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal (Q850322) (← links)
- Shipper collaboration (Q858256) (← links)
- Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles (Q867538) (← links)
- Arc routing problems with time-dependent service costs (Q872235) (← links)
- Heuristics for a dynamic rural postman problem (Q883291) (← links)
- Network search games with immobile hider, without a designated searcher starting point (Q933761) (← links)
- Lower bounds for the mixed capacitated arc routing problem (Q1040970) (← links)
- Heuristic methods for the sectoring arc routing problem (Q1041923) (← links)
- The rural postman problem with deadline classes (Q1291753) (← links)
- Modeling and solving several classes of arc routing problems as traveling salesman problems (Q1374032) (← links)
- Planning models for long-haul operations of postal and express shipment companies (Q1582188) (← links)
- Districting for salt spreading operations (Q1598721) (← links)
- Multi-vehicle prize collecting arc routing for connectivity problem (Q1652266) (← links)
- Hybrid genetic algorithm for the open capacitated arc routing problem (Q1652524) (← links)
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics (Q1730649) (← links)
- Capacitated arc routing problem with deadheading demands (Q1761173) (← 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 heuristic for the periodic rural postman problem (Q1885936) (← links)
- Time-constrained Chinese postman problems (Q1886476) (← links)
- Heuristic method for a mixed capacitated arc routing problem: A refuse collection application (Q1887872) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Online graph exploration: New results on old and new algorithms (Q1929219) (← links)
- Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← links)
- Lower-bounding and heuristic methods for a refuse collection vehicle routing problem (Q1969871) (← links)
- An algorithm for the hierarchical Chinese postman problem (Q1970425) (← links)
- An efficient transformation of the generalized vehicle routing problem (Q1971986) (← links)
- DNA origami and the complexity of Eulerian circuits with turning costs (Q2003481) (← links)
- OAR lib: an open source arc routing library (Q2293658) (← links)
- An integer programming approach for the Chinese postman problem with time-dependent travel time (Q2343981) (← links)
- Solution of real-world postman problems (Q2482818) (← links)
- On the high multiplicity traveling salesman problem (Q2494812) (← links)
- A constructive heuristic for the undirected rural postman problem (Q2496045) (← links)
- On the hierarchical Chinese postman problem with linear ordered classes (Q2569095) (← links)
- Arc routing under uncertainty: introduction and literature review (Q2669541) (← links)
- Approximation algorithms for multi-vehicle stacker crane problems (Q2687683) (← links)
- The capacitated arc routing problem with intermediate facilities (Q2719845) (← links)
- Forty years of periodic vehicle routing (Q2811320) (← links)
- The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth (Q2835842) (← links)
- The time-dependent rural postman problem: polyhedral results (Q2867412) (← links)
- Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs (Q2958236) (← links)
- Searching symmetric networks with Utilitarian-Postman paths (Q3057096) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- Efficient Algorithms for Eulerian Extension (Q3057616) (← links)
- Hide-and-seek games on a tree to which Eulerian networks are attached (Q3184601) (← links)
