Pages that link to "Item:Q3392004"

The following pages link to A Branch-and-Cut Algorithm for the Dial-a-Ride Problem (Q3392004):

Displaying 50 items.

• A cutting plane method for solving harvest scheduling models with area restrictions (Q257266) (← links)
• A comparison of column-generation approaches to the synchronized pickup and delivery problem (Q319923) (← links)
• Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560) (← links)
• Hybrid column generation and large neighborhood search for the dial-a-ride problem (Q339608) (← links)
• Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
• A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases (Q420868) (← links)
• Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (Q443822) (← links)
• A reduction approach to the two-campus transport problem (Q490382) (← links)
• An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays (Q540153) (← links)
• An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows (Q617511) (← links)
• Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation (Q632696) (← links)
• Local search heuristics for the probabilistic dial-a-ride problem (Q657055) (← links)
• An optimization model and a solution algorithm for the many-to-many car pooling problem (Q763101) (← links)
• The flexible and real-time commute trip sharing problems (Q823767) (← links)
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← links)
• A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows (Q892384) (← links)
• A branch-and-cut algorithm for factory crane scheduling problem (Q897052) (← links)
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method (Q1044088) (← links)
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716) (← links)
• The pickup and delivery problem: Faces and branch-and-cut algorithm (Q1368475) (← links)
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms (Q1432014) (← links)
• Daily aircraft routing for amphibious ready groups (Q1639311) (← links)
• Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation (Q1652021) (← links)
• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem (Q1652211) (← links)
• Solving a selective dial-a-ride problem with logic-based Benders decomposition (Q1652651) (← links)
• The stop number minimization problem: complexity and polyhedral analysis (Q1661860) (← links)
• Typology and literature review for dial-a-ride problems (Q1698288) (← links)
• Pickup and delivery problem with time windows: a new compact two-index formulation (Q1728253) (← links)
• Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system (Q1751731) (← links)
• Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles (Q1752844) (← links)
• Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive (Q1786606) (← links)
• Granular tabu search for the pickup and delivery problem with time windows and electric vehicles (Q1999625) (← links)
• The pickup and delivery problem with time windows and occasional drivers (Q2003570) (← links)
• Analysing the effect of partner characteristics on the performance of horizontal carrier collaborations (Q2005850) (← links)
• The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach (Q2029026) (← links)
• Pickup and delivery problem with recharging for material handling systems utilising autonomous mobile robots (Q2029292) (← links)
• Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm (Q2029308) (← links)
• Strong cuts from compatibility relations for the dial-a-ride problem (Q2065792) (← links)
• Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects (Q2070134) (← links)
• The value of personalized dispatch in O2O on-demand delivery services (Q2079410) (← links)
• The pickup and delivery problem with transshipments: critical review of two existing models and a new formulation (Q2083950) (← links)
• An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization (Q2125364) (← links)
• A dynamic tree algorithm for peer-to-peer ridesharing matching (Q2129373) (← links)
• The complexity of the unit stop number problem and its implications to other related problems (Q2136280) (← links)
• The pickup and delivery problem with time windows, multiple stacks, and handling operations (Q2140213) (← links)
• Event-based MILP models for ridepooling applications (Q2140290) (← links)
• Transport of skips between recycling centers and treatment facilities (Q2147169) (← links)
• Feeder routing for air-to-air refueling operations (Q2171624) (← links)
• Exact algorithms for the multi-pickup and delivery problem with time windows (Q2178121) (← links)
• Dynamic transportation of patients in hospitals (Q2267375) (← links)