A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation
From MaRDI portal
(Redirected from Publication:645558)
Recommendations
- New heuristic methods for the capacitated multi-facility Weber problem
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
- Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
- Global optimization algorithm for capacitated multi-facility continuous location-allocation problems
- The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods
Cites work
- scientific article; zbMATH DE number 1253040 (Why is no real title available?)
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- A heuristic method for large-scale multi-facility location problems
- A nonsmooth version of Newton's method
- A polynomial time dual algorithm for the Euclidean multifacility location problem
- A quadratically convergent method for minimizing a sum of euclidean norms
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A smoothing Newton method for minimizing a sum of Euclidean norms
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Applications of second-order cone programming
- Approximation Algorithms for Metric Facility Location Problems
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Convexification procedures and decomposition methods for nonconvex optimization problems
- Global Optimization Procedures for the Capacitated Euclidean and lp Distance Multifacility Location-Allocation Problems
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Matrix Analysis
- NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
- New heuristic methods for the capacitated multi-facility Weber problem
- On the local convergence of semismooth Newton methods for linear and nonlinear second-order cone programs without strict complementarity
- Second-order cone programming
- Smoothing functions for second-order-cone complementarity problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- The Transportation-Location Problem
- The facility location problem with general cost functions
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(3)- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Hybrid cell selection-based heuristic for capacitated multi-facility weber problem with continuous fixed costs
- Global optimization algorithm for capacitated multi-facility continuous location-allocation problems
This page was built for publication: A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645558)
