A branch-and-price algorithm for the minimum latency problem
type: Item
instance of: scholarly article
title: A branch-and-price algorithm for the minimum latency problem
zbMATH Open document ID: 1391.90048
author: Teobaldo L. Bulhões Júnior
author: Ruslan Sadykov
author: Eduardo Uchoa
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6901569
zbMATH Keywords: minimum latency
zbMATH Keywords: \(ng\)-paths
zbMATH Keywords: branch-and-price
describes a project that uses: VRP
describes a project that uses: BaPCod
MaRDI profile type: Publication
full work available at URL: j.cor.2018.01.016
OpenAlex ID: W2790488300
cites work: The time dependent traveling salesman problem: polyhedra and algorithm
cites work: Q5241193
cites work: The complexity of the travelling repairman problem
cites work: Q5417636
cites work: Q4471278
cites work: New route relaxation and pricing strategies for the vehicle routing problem
cites work: The traveling salesman problem with cumulative costs
cites work: The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
cites work: The minimum latency problem
cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
cites work: Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
cites work: The Delivery Man Problem and Cumulative Matroids
cites work: Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
cites work: A note on the traveling repairman problem
cites work: Natural and extended formulations for the time-dependent traveling salesman problem
cites work: Resource extension functions: properties, inversion, and generalization to segments
cites work: Shortest Path Problems with Resource Constraints
cites work: Path-reduced costs for eliminating arcs in routing and scheduling
cites work: The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
cites work: Q5503674
cites work: Time‐dependent traveling salesman problem–the deliveryman case
cites work: A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
cites work: Efficient elementary and restricted non-elementary route pricing
cites work: A new formulation for the traveling deliveryman problem
cites work: Variable neighborhood search for the travelling deliveryman problem
cites work: An effective memetic algorithm for the cumulative capacitated vehicle routing problem
cites work: New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
cites work: Improved branch-cut-and-price for capacitated vehicle routing
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
cites work: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
cites work: New dynamic programming algorithms for the resource constrained elementary shortest path problem
cites work: Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem
cites work: P-Complete Approximation Problems
cites work: Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
cites work: A simple and effective metaheuristic for the minimum latency problem
cites work: Q4737530
cites work: Special cases of traveling salesman and repairman problems with time windows
DOI: 10.1016/J.COR.2018.01.016
description: scientific article; zbMATH DE number 6901569