BILINEAR PROGRAMMING FORMULATIONS FOR WEBER PROBLEMS WITH CONTINUOUS AND NETWORK DISTANCES

DOI10.15807/JORSJ.48.123MaRDI QIDQ5694062zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A unified model for Weber problems with continuous and network distances
• scientific article; zbMATH DE number 4061001
• A bilinear relaxation based algorithm for concave piecewise linear network flow problems
• Dual network bounds for integer programming problems of a special form
• A mixed integer linear programming formulation of the maximum betweenness problem
• scientific article; zbMATH DE number 4149915
• scientific article; zbMATH DE number 4145675
• Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
• scientific article; zbMATH DE number 1186901
• Network optimization with piecewise linear convex costs

Cited in

(7)

• Corrigendum to ``Simultaneous location of a service facility and a rapid transit line [Computers \& Operations Research 38 (2) (2011) 525-538]
• A unified model for Weber problems with continuous and network distances
• Weber problems with mixed distances and regional demand
• A modeling framework on distance predicting functions for location models in continuous space
• Weber problems with high-speed lines
• Solving net-constrained clustering problem
• 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

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