Solution of a min-max vehicle routing problem
From MaRDI portal
(Redirected from Publication:2884530)
Recommendations
- A branch-and-cut algorithm for vehicle routing problems
- On distributed solving of the capacitated vehicle routing problem with branch-and-cut algorithms
- On the vehicle routing problem
- A cutting plane procedure for the travelling salesman problem on road networks
- A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
Cited in
(33)- Improved load balancing and resource utilization for the skill vehicle routing problem
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
- An overview of graph covering and partitioning
- Memetic search for the minmax multiple traveling salesman problem with single and multiple depots
- Using \(\ell^p\)-norms for fairness in combinatorial optimisation
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem
- An approximation algorithm for vehicle routing with compatibility constraints
- Whizzkids: Two exercises in computational discrete optimization
- A metaheuristic for the min-max windy rural postman problem with K vehicles
- The effect of the asymmetry of road transportation networks on the traveling salesman problem
- A matheuristic for the MinMax capacitated open vehicle routing problem
- Minimum makespan vehicle routing problem with compatibility constraints
- Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem
- Multilocus consensus genetic maps (MCGM): Formulation, algorithms, and results
- Efficient branching rules for optimizing range and order-based objective functions
- Computational Science – ICCS 2005
- Memetic algorithm-based path generation for multiple Dubins vehicles performing remote tasks
- Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs
- A min-max vehicle routing problem with split delivery and heterogeneous demand
- An active set smoothing method for solving unconstrained minimax problems
- Approximations for minimum and min-max vehicle routing problems
- Approximation algorithms for solving the trip-constrained vehicle routing cover problems
- A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
- A generalized set partitioning model for MinMax vehicle routing
- An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems
- Distance constrained vehicle routing problem to minimize the total cost
- A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- A truncated aggregate smoothing Newton method for minimax problems
- Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
- Gossip algorithms for heterogeneous multi-vehicle routing problems
- A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem
This page was built for publication: Solution of a min-max vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884530)
