Solution of a min-max vehicle routing problem
DOI10.1287/IJOC.14.2.132.118zbMATH Open1238.90110DBLPjournals/informs/ApplegateCDR02OpenAlexW2144045033WikidataQ63101916 ScholiaQ63101916MaRDI QIDQ2884530FDOQ2884530
Sanjeeb Dash, David Applegate, André Rohe, William Cook
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0bee15723325180d0fa2d55a3d50240a20e9ce21
Case-oriented studies in operations research (90B90) Combinatorial optimization (90C27) Integer programming (90C10) Discrete location and assignment (90B80)
Cited In (31)
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
- An overview of graph covering and partitioning
- Improved load balancing and resource utilization for the skill vehicle routing problem
- 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
- A matheuristic for the MinMax capacitated open vehicle routing problem
- The effect of the asymmetry of road transportation networks on the traveling salesman problem
- Minimum makespan vehicle routing problem with compatibility constraints
- Computational Science – ICCS 2005
- Multilocus consensus genetic maps (MCGM): Formulation, algorithms, and results
- Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem
- 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
- Approximations for minimum and min-max vehicle routing problems
- An active set smoothing method for solving unconstrained minimax 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
- 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
Uses Software
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)
