Sequential location of two facilities: comparing random to optimal location of the first facility
From MaRDI portal
Publication:512975
Recommendations
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
- Sequential location problems
- scientific article; zbMATH DE number 5991640
- Randomized local search for the discrete competitive facility location problem
- Sequential location-allocation of public facilities in one- and two- dimensional space: Comparison of several policies
Cites work
- scientific article; zbMATH DE number 1803754 (Why is no real title available?)
- scientific article; zbMATH DE number 1803756 (Why is no real title available?)
- scientific article; zbMATH DE number 3863589 (Why is no real title available?)
- scientific article; zbMATH DE number 31720 (Why is no real title available?)
- scientific article; zbMATH DE number 53335 (Why is no real title available?)
- scientific article; zbMATH DE number 679868 (Why is no real title available?)
- scientific article; zbMATH DE number 714537 (Why is no real title available?)
- scientific article; zbMATH DE number 1455125 (Why is no real title available?)
- scientific article; zbMATH DE number 7005721 (Why is no real title available?)
- scientific article; zbMATH DE number 219845 (Why is no real title available?)
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- A d.c. optimization method for single facility location problems
- A general global optimization approach for solving location problems in the plane
- A new formulation for the conditional \(p\)-median and \(p\)-center problems
- A note on accelerating the weiszfeld procedure
- AVOIDING CANNIBALISATION AND/OR COMPETITOR REACTION IN PLANAR SINGLE FACILITY LOCATION
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Continuous location problems and big triangle small triangle: Constructing better bounds
- Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
- Dynamic facility location: The progressive p-median problem
- Finding a cluster of points and the grey pattern quadratic assignment problem
- GBSSS: The generalized big square small square method for planar single- facility location
- Heuristic Methods for Location-Allocation Problems
- LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION
- Location-Allocation Problems
- New approaches to circle packing in a square. With program codes.
- On functions representable as a difference of convex functions
- On solving a d.c. programming problem by a sequence of linear programs
- On the point for which the sum of the distances to \(n\) given points is minimum
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Sequential location problems
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
- 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
- The big cube small cube solution method for multidimensional facility location problems
- The fortified Weiszfeld algorithm for solving the Weber problem
- The p-center location problem in an area
Cited in
(3)
This page was built for publication: Sequential location of two facilities: comparing random to optimal location of the first facility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512975)
