A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation
From MaRDI portal
Publication:645558
DOI10.1007/S10898-010-9632-7zbMATH Open1279.90133OpenAlexW2016363262MaRDI QIDQ645558FDOQ645558
Authors: Chun-Hsu Ko, Jein-Shan Chen, Shaohua Pan 
Publication date: 8 November 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9632-7
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
nonconvexsemismooth Newton methodnondifferentiablecapacitated multi-facility Weber problemsecond-order cone program
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Matrix Analysis
- Title not available (Why is that?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- A quadratically convergent method for minimizing a sum of euclidean norms
- A nonsmooth version of Newton's method
- Title not available (Why is that?)
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Applications of second-order cone programming
- Second-order cone programming
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Smoothing functions for second-order-cone complementarity problems
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- A polynomial time dual algorithm for the Euclidean multifacility location problem
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- The facility location problem with general cost functions
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Approximation Algorithms for Metric Facility Location Problems
- On the local convergence of semismooth Newton methods for linear and nonlinear second-order cone programs without strict complementarity
- A heuristic method for large-scale multi-facility location problems
- New heuristic methods for the capacitated multi-facility Weber problem
- Global Optimization Procedures for the Capacitated Euclidean and lp Distance Multifacility Location-Allocation Problems
- NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
- The Transportation-Location Problem
- Title not available (Why is that?)
- A smoothing Newton method for minimizing a sum of Euclidean norms
- Convexification procedures and decomposition methods for nonconvex optimization problems
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
Uses Software
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)
