Pages that link to "Item:Q4861354"

The following pages link to Arc Routing Problems, Part II: The Rural Postman Problem (Q4861354):

Displaying 41 items.

• Domino sequencing: scheduling with state-based sequence-dependent setup times (Q2294316) (← links)
• Exact approaches for the cutting path determination problem (Q2329729) (← links)
• An integer programming approach for the Chinese postman problem with time-dependent travel time (Q2343981) (← links)
• New heuristic algorithms for the windy rural postman problem (Q2387296) (← links)
• On Eulerian extensions and their application to no-wait flowshop scheduling (Q2434285) (← links)
• Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems (Q2494509) (← links)
• A comparison of two different formulations for arc routing problems on mixed graphs (Q2496040) (← links)
• A constructive heuristic for the undirected rural postman problem (Q2496045) (← links)
• The directed profitable location rural postman problem (Q2514733) (← links)
• On the hierarchical Chinese postman problem with linear ordered classes (Q2569095) (← links)
• Solving capacitated arc routing problems using a transformation to the CVRP (Q2581620) (← links)
• The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable (Q2661637) (← links)
• Arc routing under uncertainty: introduction and literature review (Q2669541) (← links)
• A partitioning column approach for solving LED sorter manipulator path planning problems (Q2673413) (← links)
• Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems (Q2676463) (← links)
• The capacitated arc routing problem with intermediate facilities (Q2719845) (← links)
• Forty years of periodic vehicle routing (Q2811320) (← 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)
• Min-Max <i>K</i> -vehicles windy rural postman problem (Q3057121) (← links)
• Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
• Efficient Algorithms for Eulerian Extension (Q3057616) (← links)
• From Few Components to an Eulerian Graph by Adding Arcs (Q3104786) (← links)
• Solving the time varying postman problems with timed automata (Q3458818) (← links)
• A Decade of Capacitated Arc Routing (Q3564348) (← links)
• Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
• Arc Routing Problems, Part I: The Chinese Postman Problem (Q4849324) (← links)
• Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566) (← links)
• (Q5271452) (← links)
• Solving the Periodic Edge Routing Problem in the Municipal Waste Collection (Q5348803) (← links)
• Approximate solutions for the maximum benefit chinese postman problem (Q5426612) (← links)
• A taboo search heuristic for the optimisation of a multistage component placement system (Q5718001) (← links)
• Modeling the Pre Auction Stage The Truckload Case (Q5850937) (← links)
• Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918581) (← links)
• Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918727) (← links)
• Approximation algorithms for some minimum postmen cover problems (Q5918771) (← links)
• The Rural Postman Problem on mixed graphs with turn penalties (Q5959378) (← links)
• Modeling and solving the endpoint cutting problem (Q6056164) (← links)
• On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
• A heuristic algorithm for the drone rural postman problem (Q6536949) (← links)
• Approximation algorithms for two clustered arc routing problems (Q6645185) (← links)