A d.c. optimization method for single facility location problems
From MaRDI portal
Publication:1904649
DOI10.1007/BF01097061zbMath0841.90082MaRDI QIDQ1904649
Fangjun Zhou, Faiz A. Al-Khayyal, Hoang Tuy
Publication date: 7 January 1996
Published in: Journal of Global Optimization (Search for Journal in Brave)
global optimizationnondifferentiable optimizationdifference of two convex functionssingle facility locationd.c. optimizationgeneral attraction and repulsion functions
Related Items
A note on equity across groups in facility location, Solving the median problem with continuous demand on a network, LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION, Location of a distribution center for a perishable product, Equity models in planar location, The theoretical and empirical rate of convergence for geometric branch-and-bound methods, Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver, Gradual cover competitive facility location, Fitting concentric circles to measurements, Locating a semi-obnoxious covering facility with repelling polygonal regions, A continuous location model for siting a non-noxious undesirable facility within a geographical region, Single-facility huff location problems on networks, Sequential location of two facilities: comparing random to optimal location of the first facility, Theoretical rate of convergence for interval inclusion functions, On minimax-regret Huff location models, Optimizing the location of a production firm, A general global optimization approach for solving location problems in the plane, The big cube small cube solution method for multidimensional facility location problems, A robust and efficient algorithm for planar competitive location problems, On a branch-and-bound approach for a Huff-like Stackelberg location problem, Big segment small segment global optimization algorithm on networks, Semi-obnoxious location models: A global optimization approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the global minimization of a convex function under general nonconvex constraints
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization
- On nonconvex optimization problems with separated nonconvex variables
- Polyhedral annexation, dualization and dimension reduction technique in global optimization
- Approximation of solutions for location problems
- Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming
- The Weber Problem On The Plane With Some Negative Weights
- Global minimization of a difference of two convex functions
- The Facility Location Problem with Limited Distances
- Convex Analysis
