Pages that link to "Item:Q1278493"

The following pages link to New inequalities for the general routing problem (Q1278493):

Displaying 15 items.

• Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
• A branch-and-cut algorithm for the orienteering arc routing problem (Q342166) (← links)
• Modeling and solving the mixed capacitated general routing problem (Q375984) (← links)
• Lower bounds and heuristics for the windy rural postman problem (Q852946) (← links)
• The rural postman problem with deadline classes (Q1291753) (← links)
• The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra (Q1296789) (← links)
• A heuristic algorithm based on Monte Carlo methods for the rural postman problem. (Q1406725) (← links)
• The general routing polyhedron: A unifying framework (Q1806888) (← links)
• The Steiner traveling salesman problem and its extensions (Q1999396) (← links)
• On the distance-constrained close enough arc routing problem (Q2029943) (← links)
• Integer programming formulation and polyhedral results for windy collaborative arc routing problem (Q2146988) (← links)
• On the general routing polytope (Q2473035) (← links)
• A note on the undirected rural postman problem polytope (Q2492671) (← links)
• Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems (Q2494509) (← links)
• A constructive heuristic for the undirected rural postman problem (Q2496045) (← links)