Pages that link to "Item:Q3325496"

The following pages link to Two exact algorithms for the distance-constrained vehicle routing problem (Q3325496):

Displaying 23 items.

• The school bus problem on trees (Q378249) (← links)
• Exact hybrid algorithms for solving a bi-objective vehicle routing problem (Q441036) (← links)
• A branch and bound algorithm for the capacitated vehicle routing problem (Q585095) (← links)
• Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
• A mixed constrained (identical) vehicle routing problem for time minimisation (Q998682) (← links)
• A cutting plane procedure for the travelling salesman problem on road networks (Q1072449) (← links)
• Polyhedral results for a vehicle routing problem (Q1176821) (← links)
• \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective (Q1363767) (← links)
• Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
• Probabilistic time-dependent vehicle routing problem (Q1788926) (← links)
• The close-open mixed vehicle routing problem (Q1926744) (← links)
• A truck and drones model for last-mile delivery: a mathematical model and heuristic approach (Q1988950) (← links)
• A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation (Q2003563) (← links)
• An overview of graph covering and partitioning (Q2142633) (← links)
• The median routing problem for simultaneous planning of emergency response and non-emergency jobs (Q2183877) (← links)
• Approximation algorithms for distance constraint sweep coverage with base stations (Q2424716) (← links)
• Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots (Q2427108) (← links)
• The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem (Q2489310) (← links)
• A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes (Q2514736) (← links)
• Using \(\ell^p\)-norms for fairness in combinatorial optimisation (Q2664297) (← links)
• Routing and scheduling field service operation by P-graph (Q2669568) (← links)
• The vehicle sharing and task allocation problem: MILP formulation and a heuristic solution approach (Q2676335) (← links)
• Approximation algorithms for distance constrained vehicle routing problems (Q2892157) (← links)