Construction Line Algorithms for the Connection Location-Allocation Problem

DOI10.1007/978-3-540-77903-2_53MaRDI QIDQ5391943zbMATH OpenOpenAlexFDO

Authors Martin Bischoff, Yvonne Bayer

Publication date 7 April 2011

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

Full work available at URL https://doi.org/10.1007/978-3-540-77903-2_53

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Recommendations

• Capacitated location-allocation problems on a line
• Approximation algorithms for connected facility location problems
• Capacitated Location Problems on a Line
• Primal-dual algorithms for connected facility location problems
• scientific article; zbMATH DE number 1947062
• Approximation Algorithms for Problems Combining Facility Location and Network Design
• scientific article; zbMATH DE number 4051669
• Line planning, path constrained network flow and inapproximability
• A fast algorithm for near cost optimal line plans
• The point-to-point connection problem - analysis and algorithms

Cites work

• scientific article; zbMATH DE number 1746287 (Why is no real title available?)
• scientific article; zbMATH DE number 1855792 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• Allocation search methods for a generalized class of location-allocation problems
• An efficient solution method for Weber problems with barriers based on genetic algorithms
• Geometrical properties of the Fermat-Weber problem
• Hull properties in location problems
• Location-Allocation Problems
• On the Set of Optimal Points to the Weber Problem: Further Results
• Planar Weber location problems with barriers and block norms
• Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
• The \(K\)-connection location problem in a plane

Cited in

(2)

• Location of connection facilities.
• The \(K\)-connection location problem in a plane

This page was built for publication: Construction Line Algorithms for the Connection Location-Allocation Problem

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