Sequential location of two facilities: comparing random to optimal location of the first facility
From MaRDI portal
Publication:512975
DOI10.1007/s10479-014-1699-yzbMath1357.90080OpenAlexW2086630717MaRDI QIDQ512975
Publication date: 3 March 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1699-y
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The big cube small cube solution method for multidimensional facility location problems
- On functions representable as a difference of convex functions
- New approaches to circle packing in a square. With program codes.
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
- A general global optimization approach for solving location problems in the plane
- A new formulation for the conditional \(p\)-median and \(p\)-center problems
- On the point for which the sum of the distances to \(n\) given points is minimum
- Continuous location problems and big triangle small triangle: Constructing better bounds
- On solving a d.c. programming problem by a sequence of linear programs
- GBSSS: The generalized big square small square method for planar single- facility location
- Sequential location problems
- Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
- A d.c. optimization method for single facility location problems
- Finding a cluster of points and the grey pattern quadratic assignment problem
- Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming
- Technical Note—Conditional Location Problems on Networks
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- Location-Allocation Problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- The p-center location problem in an area
- Dynamic facility location: The progressive p-median problem
- A note on accelerating the weiszfeld procedure
- Heuristic Methods for Location-Allocation Problems
- LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION
- The fortified Weiszfeld algorithm for solving the Weber problem
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- AVOIDING CANNIBALISATION AND/OR COMPETITOR REACTION IN PLANAR SINGLE FACILITY LOCATION
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Sequential location of two facilities: comparing random to optimal location of the first facility
