Location routing problems on trees

DOI10.1016/j.dam.2018.12.026zbMath1407.05046OpenAlexW2914828391WikidataQ128531377 ScholiaQ128531377MaRDI QIDQ1735670

Julián Aráoz, Salvador Rueda, Elena Fernández

Publication date: 28 March 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/171442

zbMATH Keywords

treeslocationroutingoptimal algorithmstotally unimodularmathematical programming formulation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Location‐routing problem: a classification of recent research

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of recent research on location-routing problems
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• Location-routing: issues, models and methods
• A compact model and tight bounds for a combined location-routing problem
• Balanced matrices
• Privatized rural postman problems
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• A taxonomical analysis, current methods and objectives on location-routing problems
• A Class of Balanced Matrices Arising from Location Problems
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• The generalized P‐forest problem on a tree network
• Implementing vehicle routing algorithms

This page was built for publication: Location routing problems on trees