The Weber Location Problem: The Threshold Objective

DOI10.3138/infor.49.3.212MaRDI QIDQ6102732

Tammy Drezner, Zvi Drezner

Publication date: 9 May 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

zbMATH Keywords

locationWeber problemthresholdstochastic

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Asymptotic behavior of the Weber location problem on the plane
• A general global optimization approach for solving location problems in the plane
• The Weber Problem On The Plane With Some Negative Weights
• A stochastic gradual cover location problem
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• Two algorithms for constructing a Delaunay triangulation
• Probabilistic Weights in the One-Dimensional Facility Location Problem
• A Stochastic Programming Model
• Locating a service facility with some unserviced demand
• Optimum Locations on a Graph with Probabilistic Demands
• Letter to the Editor—Optimum Locations on Graphs with Correlated Normal Demands
• Location Theory, Dominance, and Convexity
• The 1-Median And 1-Antimedian Problems With Continuous Probabilistic Demand Weights
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Weber Location Problem: The Threshold Objective