Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems

DOI10.1287/opre.37.3.447zbMath0674.90020OpenAlexW2153335695MaRDI QIDQ3829319

Timothy J. Lowe, Richard L. Francis, Erhan Erkut, Arie Tamir

Publication date: 1989

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.37.3.447

zbMATH Keywords

upper boundsduality theoryshortest path algorithmstree networkconstraint functionsnetwork facility locationspecial purpose column generation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Inventory, storage, reservoirs (90B05)

Related Items (5)

A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem ⋮ The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy ⋮ The 2-radius and 2-radiian problems on trees ⋮ Locating facilities which interact: Some solvable cases ⋮ An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree

This page was built for publication: Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems