On the convergence of the Cooper's algorithm

DOI10.1007/s11590-020-01572-5zbMath1460.90196OpenAlexW3012741977MaRDI QIDQ2228419

Ahmadreza Raeisi Dehkordi

Publication date: 17 February 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-020-01572-5

zbMATH Keywords

convergencesubdifferentialconstrained multi-source Weber problemCooper's algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Cites Work

• A guided reactive GRASP for the capacitated multi-source Weber problem
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• A cellular heuristic for the multisource Weber problem.
• An algorithm for generalized constrained multi-source Weber problem with demand substations
• A heuristic method for large-scale multi-facility location problems
• The optimal solution set of the multi-source Weber problem
• A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
• NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
• Heuristic Methods for Location-Allocation Problems
• Constructive heuristics for the uncapacitated continuous location-allocation problem
• Convex Analysis

This page was built for publication: On the convergence of the Cooper's algorithm