Solution of the multisource Weber and conditional Weber problems by d. -c. programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 970362
- LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION
- A d.c. optimization method for single facility location problems
- On solving a d.c. programming problem by a sequence of linear programs
- Clustering and multifacility location with constraints via distance function penalty methods and DC programming
Cited in
(31)- Stabilized column generation
- A two-echelon joint continuous-discrete location model
- Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- A d.c. optimization method for single facility location problems
- A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming
- The DTC (difference of tangentially convex functions) programming: optimality conditions
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- The optimal solution set of the multi-source Weber problem
- Generating good starting solutions for the \(p\)-median problem in the plane
- Global convergence of a proximal linearized algorithm for difference of convex functions
- New heuristic algorithms for solving the planar p-median problem
- The impact of cost uncertainty on the location of a distribution center
- Double bundle method for finding Clarke stationary points in nonsmooth DC programming
- Solving DC programs using the cutting angle method
- Minsum location extended to gauges and to convex sets
- Sequential location of two facilities: comparing random to optimal location of the first facility
- New local searches for solving the multi-source Weber problem
- scientific article; zbMATH DE number 970362 (Why is no real title available?)
- Location Science in Canada
- An agent-based framework for modeling and solving location problems
- Clustering and the perturbed spatial median
- On the rate of convergence of the difference-of-convex algorithm (DCA)
- Constructing tight quadratic relaxations for global optimization. II: underestimating difference-of-convex (D.C.) functions
- Facility location models for distribution system design
- On minimax-regret Huff location models
- An adaptive proximal safeguarded augmented Lagrangian method for nonsmooth DC problems with convex constraints
- L₁-norm regularized indefinite kernel logistic regression
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
- Spatial point process models for location-allocation problems
This page was built for publication: Solution of the multisource Weber and conditional Weber problems by d. -c. programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2770097)
