BILINEAR PROGRAMMING FORMULATIONS FOR WEBER PROBLEMS WITH CONTINUOUS AND NETWORK DISTANCES

DOI10.15807/jorsj.48.123zbMath1274.90241OpenAlexW2119897462MaRDI QIDQ5694062

B. Pfeiffer, Kathrin Klamroth

Publication date: 29 September 2005

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.48.123

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Continuous location (90B85) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (5)

A unified model for Weber problems with continuous and network distances ⋮ Weber problems with high-speed lines ⋮ Weber problems with mixed distances and regional demand ⋮ Corrigendum to ``Simultaneous location of a service facility and a rapid transit line [Computers \& Operations Research 38 (2) (2011) 525-538] ⋮ Simultaneous location of a service facility and a rapid transit line

This page was built for publication: BILINEAR PROGRAMMING FORMULATIONS FOR WEBER PROBLEMS WITH CONTINUOUS AND NETWORK DISTANCES