Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems

DOI10.1287/OPRE.37.3.447MaRDI QIDQ3829319zbMATH OpenOpenAlexFDO

Authors Erhan Erkut, Richard L. Francis, Timothy J. Lowe, 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

constraint functionsduality theorynetwork facility locationshortest path algorithmsspecial purpose column generationtree networkupper bounds

Mathematics Subject Classification ID

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

Recommendations

• Distance-constrained multifacility minimax location problems on tree networks
• scientific article; zbMATH DE number 3843458
• Locating Two Facilities on a Tree Subject to Distance Constraints
• Two classes of location problems on tree networks
• Optimal location of interconnected facilities on tree networks subject to distance constraints

Cited in

(5)

• An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree
• 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
• Locating facilities which interact: Some solvable cases
• The 2-radius and 2-radiian problems on trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3829319)