Solution of a Min-Max Vehicle Routing Problem
From MaRDI portal
Publication:2884530
DOI10.1287/ijoc.14.2.132.118zbMath1238.90110OpenAlexW2144045033WikidataQ63101916 ScholiaQ63101916MaRDI QIDQ2884530
Sanjeeb Dash, David L. 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
Integer programming (90C10) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)
Related Items
Min-Max vs. Min-Sum vehicle routing: a worst-case analysis, An overview of graph covering and partitioning, Hybrid search with neighborhood reduction for the multiple traveling salesman problem, Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem, A min-max vehicle routing problem with split delivery and heterogeneous demand, Using \(\ell^p\)-norms for fairness in combinatorial optimisation, Improved load balancing and resource utilization for the skill vehicle routing problem, A matheuristic for the MinMax capacitated open vehicle routing problem, An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems, Memetic search for the minmax multiple traveling salesman problem with single and multiple depots, Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover, A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem, Gossip algorithms for heterogeneous multi-vehicle routing problems, The effect of the asymmetry of road transportation networks on the traveling salesman problem, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, Minimum makespan vehicle routing problem with compatibility constraints, Multilocus consensus genetic maps (MCGM): Formulation, algorithms, and results, A truncated aggregate smoothing Newton method for minimax problems, A metaheuristic for the min-max windy rural postman problem with K vehicles, Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs, A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem, An approximation algorithm for vehicle routing with compatibility constraints, An active set smoothing method for solving unconstrained minimax problems, Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems, A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem, Memetic algorithm-based path generation for multiple Dubins vehicles performing remote tasks
Uses Software
