The Delivery Man Problem and Cumulative Matroids
From MaRDI portal
Publication:4285163
DOI10.1287/opre.41.6.1055zbMath0791.90062OpenAlexW2020931444MaRDI QIDQ4285163
Gilbert Laporte, Matteo Fischetti, Silvano Martello
Publication date: 13 July 1994
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.41.6.1055
Programming involving graphs or networks (90C35) Integer programming (90C10) Linear programming (90C05) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
A constant-factor approximation for directed latency in quasi-polynomial time, Network construction problems with due dates, Maintenance scheduling of geographically distributed assets with prognostics information, Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem, An integer programming approach for the time-dependent traveling salesman problem with time windows, A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment, A branch-and-price algorithm for the minimum latency problem, Routing problems: A bibliography, Network construction/restoration problems: cycles and complexity, Exact and Approximation Algorithms for the Expanding Search Problem, Approximation algorithms for the a priori traveling repairman, A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem, An online optimization approach for post-disaster relief distribution with online blocked edges, A comparison of three metaheuristics for the workover rig routing problem, The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach, A simple and effective metaheuristic for the minimum latency problem, Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem, Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND, Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining, An iterated local search algorithm for latency vehicle routing problems with multiple depots, The Surgical Patient Routing Problem: A Central Planner Approach, Variable neighborhood search for the travelling deliveryman problem, The cumulative school bus routing problem: Polynomial‐size formulations, The delivery man problem with time windows, The time dependent traveling salesman problem: polyhedra and algorithm, Solving the continuous flow-shop scheduling problem by metaheuristics., Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem, Approximating the \(k\)-traveling repairman problem with repair times, A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time, Natural and extended formulations for the time-dependent traveling salesman problem, Minimizing customers' waiting time in a vehicle routing problem with unit demands, Weighted online minimum latency problem with edge uncertainty, The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times, Hybrid optimization methods for time-dependent sequencing problems, The demand weighted vehicle routing problem, Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints, An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem, Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem, An effective memetic algorithm for the cumulative capacitated vehicle routing problem, Unnamed Item, Heuristic solution approaches for the cumulative capacitated vehicle routing problem, The routing open-shop problem on a network: complexity and approximation, Tree optimization based heuristics and metaheuristics in network construction problems, A bicriteria scheduling with sequence-dependent setup times, On combining machine learning with decision making, Facets and valid inequalities for the time-dependent travelling salesman problem, A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits, A new formulation for the traveling deliveryman problem, A metaheuristic for the delivery man problem with time windows, The risk-averse traveling repairman problem with profits, An improved approximation ratio for the minimum latency problem, The multi-depot \(k\)-traveling repairman problem, A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem, Solving the traveling delivery person problem with limited computational time
