The \(K\)-connection location problem in a plane

DOI10.1007/s10479-005-2045-1zbMath1114.90060OpenAlexW2039313531MaRDI QIDQ816418

Rajan Batta, Rakesh Nagi, Kathrin Klamroth, Si-Min Huang

Publication date: 9 March 2006

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

Full work available at URL: https://doi.org/10.1007/s10479-005-2045-1

zbMATH Keywords

capacityconnectionplanar location

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)

Related Items

A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations ⋮ Construction Line Algorithms for the Connection Location-Allocation Problem ⋮ Biconvex sets and optimization with biconvex functions: a survey and extensions ⋮ Allocation search methods for a generalized class of location-allocation problems ⋮ Simultaneous siting and sizing of distribution centers on a plane ⋮ Mathematical models for selection of optimal place and size of connections considering the time-value of money

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A clustering approach to the planar hub location problem
• Geometrical properties of the Fermat-Weber problem
• Distribution network design: Selection and sizing of congested connections
• Using Block Norms for Location Modeling
• On the Location of Hub Facilities
• Location-Allocation Problems
• Interacting New Facilities and Location-Allocation Problems
• Heuristic Methods for Location-Allocation Problems
• The Transportation-Location Problem
• Row-Column Aggregation for Rectilinear Distance p-Median Problems