Continuous location problems and big triangle small triangle: Constructing better bounds
From MaRDI portal
Recommendations
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- Constructibility classes for triangle location problems
- Asymptotic optimality of the triangular lattice for a class of optimal location problems
- Largest and smallest area triangles on imprecise points
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- scientific article; zbMATH DE number 1803755
- Continuous approximation formulas for location problems
- Tractable triangles and cross-free convexity in discrete optimisation
- scientific article; zbMATH DE number 2164145
- Improved complexity bounds for location problems on the real line
Cites work
- A general global optimization approach for solving location problems in the plane
- Equity models in planar location
- Finding GM-estimators with global optimization techniques
- Finding the optimal solution to the Huff based competitive location model
- GBSSS: The generalized big square small square method for planar single- facility location
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- The Minisum and Minimax Location Problems Revisited
- The gradual covering problem
Cited in
(22)- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- Solving the median problem with continuous demand on a network
- Solving a Huff-like Stackelberg location problem on networks
- Geometric branch-and-bound methods for constrained global optimization problems
- Gradual cover competitive facility location
- A global optimization procedure for the location of a median line in the three-dimensional space
- Locating a competitive facility in the plane with a robustness criterion
- On minimax-regret Huff location models
- On the norm of a dc function
- Visualizing data as objects by DC (difference of convex) optimization
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
- A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
- The multicriteria big cube small cube method
- \(p\)-facility Huff location problem on networks
- Single-facility huff location problems on networks
- A cross-monotonic cost-sharing scheme for the concave facility location game
- A general global optimization approach for solving location problems in the plane
- Continuous location of an assembly station
- Sequential location of two facilities: comparing random to optimal location of the first facility
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods
- Theoretical rate of convergence for interval inclusion functions
- Solving the 1-median problem on a network with continuous demand and demand surplus
This page was built for publication: Continuous location problems and big triangle small triangle: Constructing better bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1037367)
