scientific article; zbMATH DE number 7622570
From MaRDI portal
Publication:5051496
zbMath1499.90113MaRDI QIDQ5051496
No author found.
Publication date: 23 November 2022
Full work available at URL: https://gaceta.rsme.es/abrir.php?id=1716
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric algorithms and combinatorial optimization
- New algorithmic framework for conditional value at risk: application to stochastic fixed-charge transportation
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- General network design: a unified view of combined location and network design problems
- A New Formulation and Resolution Method for the p-Center Problem
- Solving Large p-Median Problems with a Radius Formulation
- Introduction to Stochastic Programming
- Location Theory
- Locating Objects in the Plane Using Global Optimization Techniques
- TWO THEOREMS IN GRAPH THEORY
- The Weighted Euclidean 1-Center Problem
- On the Complexity of Some Common Geometric Location Problems
- Lectures on Stochastic Programming
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Location-Allocation Problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- On Hotelling's "Stability in Competition"
- Location Science
- Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands
- Convex Approximations of Chance Constrained Programs
- Continuous Center Problems
- Equilibria in Competitive Location Models
- The Weiszfeld Algorithm: Proof, Amendments, and Extensions
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- The m-Center Problem
- The Location of Emergency Service Facilities
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: