Pages that link to "Item:Q5935711"

The following pages link to A cutting plane algorithm for the general routing problem (Q5935711):

Displaying 30 items.

• Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
• Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
• Modeling and solving the mixed capacitated general routing problem (Q375984) (← links)
• A branch-and-cut algorithm for the maximum benefit Chinese postman problem (Q378087) (← links)
• Lower bounds and heuristics for the windy rural postman problem (Q852946) (← links)
• Solving the prize-collecting rural postman problem (Q1041930) (← links)
• Heuristics for the rural postman problem (Q1046717) (← links)
• The generalized arc routing problem (Q1688441) (← links)
• The periodic rural postman problem with irregular services on mixed graphs (Q1734335) (← links)
• The Steiner traveling salesman problem and its extensions (Q1999396) (← links)
• On the distance-constrained close enough arc routing problem (Q2029943) (← links)
• An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem (Q2059872) (← links)
• Integer programming formulation and polyhedral results for windy collaborative arc routing problem (Q2146988) (← links)
• Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem (Q2162526) (← links)
• On the general routing polytope (Q2473035) (← links)
• Computing finest mincut partitions of a graph and application to routing problems (Q2473036) (← links)
• A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041) (← links)
• The mixed capacitated general routing problem under uncertainty (Q2629641) (← links)
• Vehicle routing on road networks: how good is Euclidean approximation? (Q2668618) (← links)
• Solving the close-enough arc routing problem (Q2811327) (← links)
• Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
• New facets and an enhanced branch-and-cut for the min-max <i>K</i> -vehicles windy rural postman problem (Q3113511) (← links)
• On path-bridge inequalities for the orienteering arc routing problems (Q5151530) (← links)
• A branch-and-price algorithm for the windy rural postman problem (Q5388154) (← links)
• A new integer programming formulation of the graphical traveling salesman problem (Q5918436) (← links)
• A new integer programming formulation of the graphical traveling salesman problem (Q5925646) (← links)
• A note on computational aspects of the Steiner traveling salesman problem (Q6066594) (← links)
• On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
• Improving a constructive heuristic for the general routing problem (Q6179705) (← links)
• Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem (Q6551080) (← links)