Layout of facilities with some fixed points

DOI10.1016/0305-0548(85)90057-7zbMath0608.90016OpenAlexW2088617792MaRDI QIDQ1086124

George O. Wesolowsky, Zvi Drezner

Publication date: 1985

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/25915

zbMATH Keywords

fixed pointssteepest descentcomputational resultsrectilinear distanceslocation of facilitiesmovable points on a planar areaunivariate search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05)

Related Items (3)

Optimal and approximate bottleneck Steiner trees ⋮ On the circle closest to a set of points ⋮ On weighted rectilinear 2-center and 3-center problems

Uses Software

• Algorithm 431

Cites Work

• Unnamed Item
• Complementary pivot theory of mathematical programming
• Algorithms for some minimax problems
• The Simplex Method for Quadratic Programming
• The Weighted Euclidean 1-Center Problem
• Linear Programming in Linear Time When the Dimension Is Fixed
• DISCON: A New Method for the Layout Problem
• Single Facility $l_p $-Distance Minimax Location
• A Cut Approach to the Rectilinear Distance Facility Location Problem
• A New Method for the Multifacility Minimax Location Problem
• Equilibrium Points of Bimatrix Games
• An Algorithm for Minimax Approximation in the Nonlinear Case

This page was built for publication: Layout of facilities with some fixed points