Pages that link to "Item:Q1971986"

The following pages link to An efficient transformation of the generalized vehicle routing problem (Q1971986):

Displaying 37 items.

• Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
• Efficient elementary and restricted non-elementary route pricing (Q297071) (← links)
• A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem (Q322620) (← links)
• An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size (Q336876) (← links)
• Hybrid metaheuristics for the clustered vehicle routing problem (Q337513) (← links)
• The capacitated general windy routing problem with turn penalties (Q433125) (← links)
• An improved hybrid ant-local search algorithm for the partition graph coloring problem (Q747914) (← links)
• A way to optimally solve a time-dependent vehicle routing problem with time windows (Q1002083) (← links)
• Approximation algorithms for group prize-collecting and location-routing problems (Q1003471) (← links)
• Resource planning and a depot location model for electric power restoration. (Q1428043) (← links)
• Picker routing in the mixed-shelves warehouses of e-commerce retailers (Q1634290) (← links)
• Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm (Q1651623) (← links)
• A fast two-level variable neighborhood search for the clustered vehicle routing problem (Q1652293) (← links)
• The vehicle routing problem with service level constraints (Q1681277) (← links)
• A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution (Q1681304) (← links)
• Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← links)
• A generalized shortest path tour problem with time windows (Q2082551) (← links)
• A unified exact approach for clustered and generalized vehicle routing problems (Q2108132) (← links)
• Dealing with time in the multiple traveling salespersons problem with moving targets (Q2155136) (← links)
• An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties (Q2167423) (← links)
• A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879) (← links)
• Shortest path tour problem with time windows (Q2282521) (← links)
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
• New mathematical models of the generalized vehicle routing problem and extensions (Q2428862) (← links)
• Solving an urban waste collection problem using ants heuristics (Q2475858) (← links)
• A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems (Q2488912) (← links)
• Large multiple neighborhood search for the soft-clustered vehicle-routing problem (Q2668597) (← links)
• The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem (Q2668601) (← links)
• A taxonomical analysis, current methods and objectives on location-routing problems (Q2865162) (← links)
• Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size (Q4979994) (← links)
• Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity (Q5086014) (← links)
• A Time-Indexed Generalized Vehicle Routing Model and Stabilized Column Generation for Military Aircraft Mission Planning (Q5270519) (← links)
• Location‐routing problem: a classification of recent research (Q6092538) (← links)
• Improving the efficiency of patient diagnostic specimen collection with the aid of a multi-modal routing algorithm (Q6106573) (← links)
• The vehicle routing problem with time windows and flexible delivery locations (Q6112699) (← links)
• Real-time passenger bus routing problems with preferences and tradeoffs (Q6113072) (← links)
• The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm (Q6179711) (← links)