Big segment small segment global optimization algorithm on networks
From MaRDI portal
Recommendations
- 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
- LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION
- OBNOXIOUS FACILITY LOCATION: THE CASE OF WEIGHTED DEMAND POINTS
- A d.c. optimization method for single facility location problems
Cites work
- scientific article; zbMATH DE number 961966 (Why is no real title available?)
- A d.c. optimization method for single facility location problems
- A general global optimization approach for solving location problems in the plane
- An optimal bound for d. c. programs with convex constraints
- DC programming: overview.
- Derived attractiveness of shopping malls
- Efficient solution approaches for a discrete multi-facility competitive interaction model
- Equitable service by a facility: minimizing the Gini coefficient
- Equity models in planar location
- GBSSS: The generalized big square small square method for planar single- facility location
- LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION
- Locating an undesirable facility by generalized cutting planes.
- Locating multiple competitive facilities: Spatial interaction models with variable expenditures
- Location of a facility minimizing nuisance to or from a planar network
- 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
- Replacing continuous demand with discrete demand in a competitive location model
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- The Centers and Medians of a Graph
- The Weber Problem On The Plane With Some Negative Weights
- The big cube small cube solution method for multidimensional facility location problems
- The discrete p-dispersion problem
- The minimum weighted covering location problem with distance constraints
- The multifacility maximin planar location problem with facility interaction
- Two algorithms for constructing a Delaunay triangulation
Cited in
(12)- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- On the combined inverse-square effect of multiple points in multidimensional space
- The Weber obnoxious facility location model: a big arc small arc approach
- Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
- The obnoxious facilities planar \(p\)-median problem
- Covering part of a planar network
- The quintile share ratio in location analysis
- \(p\)-facility Huff location problem on networks
- Single-facility huff location problems on networks
- New local searches for solving the multi-source Weber problem
- A branch-and-bound approach for estimating covering functionals of convex bodies
- An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network
This page was built for publication: Big segment small segment global optimization algorithm on networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3113501)
