The traveling salesman problem with cumulative costs
From MaRDI portal
Publication:5287441
DOI10.1002/net.3230230202zbMath0821.90121OpenAlexW2148742122MaRDI QIDQ5287441
Salvatore Ricciardelli, Aristide Mingozzi, Lucio Bianco
Publication date: 5 September 1993
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230230202
Lagrangean relaxationdirected graphHamiltonian circuitlower boundsheuristictravelling salesmanminimum cost tour
Programming involving graphs or networks (90C35) Integer programming (90C10) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem, A branch-and-price algorithm for the minimum latency problem, Routing problems: A bibliography, The arc-item-load and related formulations for the cumulative vehicle routing problem, An online optimization approach for post-disaster relief distribution with online blocked edges, 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, A classification of formulations for the (time-dependent) traveling salesman problem, A performance study on multi improvement neighborhood search strategy, Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining, The delivery man problem with time windows, Solving the continuous flow-shop scheduling problem by metaheuristics., Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem, Natural and extended formulations for the time-dependent traveling salesman problem, Weighted online minimum latency problem with edge uncertainty, The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times, Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints, Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem, An effective memetic algorithm for the cumulative capacitated vehicle routing problem, A bicriteria scheduling with sequence-dependent setup times, A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits, 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, A heuristic for cumulative vehicle routing using column generation
