Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming
From MaRDI portal
Publication:2770097
DOI10.1287/opre.46.4.548zbMath0979.90099OpenAlexW2133264627MaRDI QIDQ2770097
Pierre Hansen, Brigitte Jaumard, Pey-Chun Chen, Hoang Tuy
Publication date: 7 February 2002
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.46.4.548
global optimizationmultisource Weber problemd.-c. functionsd.-c. programmingdifferences of convex function
Nonconvex programming, global optimization (90C26) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
The DTC (difference of tangentially convex functions) programming: optimality conditions, Global convergence of a proximal linearized algorithm for difference of convex functions, A d.c. optimization method for single facility location problems, New heuristic algorithms for solving the planar \(p\)-median problem, A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes, An agent-based framework for modeling and solving location problems, Clustering and the perturbed spatial median, Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches, A two-echelon joint continuous-discrete location model, Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem, Location Science in Canada, The impact of cost uncertainty on the location of a distribution center, Solving DC programs using the cutting angle method, Minsum location extended to gauges and to convex sets, A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming, Sequential location of two facilities: comparing random to optimal location of the first facility, New local searches for solving the multi-source Weber problem, Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations, Spatial point process models for location-allocation problems, A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables, Facility location models for distribution system design, On minimax-regret Huff location models, Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming, Generating good starting solutions for the p-median problem in the plane, Stabilized column generation
