Pages that link to "Item:Q4004741"

The following pages link to A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows (Q4004741):

Displaying 50 items.

• Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems (Q2655613) (← links)
• Solving a rich vehicle routing and inventory problem using column generation (Q2655647) (← links)
• An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits (Q2664286) (← links)
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363) (← links)
• A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case) (Q2669724) (← links)
• Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks (Q2669733) (← links)
• A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem (Q2669775) (← links)
• A neural-network-based approach to the double traveling salesman problem. (Q2780866) (← links)
• A survey of resource constrained shortest path problems: exact solution approaches (Q2811308) (← links)
• The split delivery capacitated team orienteering problem (Q2811321) (← links)
• The team orienteering pick-up and delivery problem with time windows and its applications in fleet sizing (Q2826662) (← links)
• A note on the primal-dual column generation method for combinatorial optimization (Q2840728) (← links)
• A branch-and-price algorithm for capacitated arc routing problem with flexible time windows (Q2883579) (← links)
• Linear temporal logic vehicle routing with applications to multi-UAV mission planning (Q2903986) (← links)
• Integrated Charge Batching and Casting Width Selection at Baosteel (Q2931698) (← links)
• Solving Stochastic Ship Fleet Routing Problems with Inventory Management Using Branch and Price (Q2958618) (← links)
• An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem (Q2967616) (← links)
• Dynamic Traveling Repair Problem with an Arbitrary Time Window (Q2971153) (← links)
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints (Q3028709) (← links)
• Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm (Q3055658) (← links)
• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows (Q3057119) (← links)
• The vehicle routing problem with time windows and temporal dependencies (Q3113512) (← links)
• (Q3170975) (← links)
• A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows (Q3422371) (← links)
• Dynamic programming algorithms for the elementary shortest path problem with resource constraints (Q3439161) (← links)
• (Q3513916) (← links)
• Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows (Q3564367) (← links)
• Multiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization Logistics (Q3564374) (← links)
• Algorithms for the Vehicle Routing Problems with Time Deadlines (Q4305486) (← links)
• An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation (Q4367233) (← links)
• Vehicle Routing with Time Windows: Two Optimization Algorithms (Q4367240) (← links)
• On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows (Q4367254) (← links)
• A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows (Q4408696) (← links)
• Column-Generation in Integer Linear Programming (Q4450558) (← links)
• (Q4494449) (← links)
• New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows (Q4599317) (← links)
• A synthesis of assignment and heuristic solutions for vehicle routing with time windows (Q4661219) (← links)
• Robust Team Orienteering Problem with Decreasing Profits (Q5060796) (← links)
• Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity (Q5086014) (← links)
• Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints (Q5087714) (← links)
• Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows (Q5106417) (← links)
• The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches (Q5136080) (← links)
• A Joint Vehicle Routing and Speed Optimization Problem (Q5137953) (← links)
• A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs (Q5266610) (← links)
• A two-phase approach for jointly determining the lot size and delivery policy in a vendor-buyer integrated system with rework (Q5891691) (← links)
• A column generation approach for the split delivery vehicle routing problem (Q5894493) (← links)
• On the shortest path problem with negative cost cycles (Q5963684) (← links)
• Maritime inventory routing: recent trends and future directions (Q6056882) (← links)
• The rendezvous vehicle routing problem (Q6057627) (← links)
• Mixed integer programming formulations for the generalized traveling salesman problem with time windows (Q6057720) (← links)