A hyperbolic smoothing approach to the multisource Weber problem

DOI10.1007/S10898-014-0160-8zbMATH Open1302.90161OpenAlexW2065855550MaRDI QIDQ740639FDOQ740639

Authors: F. M. G. França, Priscila M. V. Lima, Vinicius Layter Xavier, Adilson Elias Xavier 

Publication date: 4 September 2014

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-014-0160-8

Recommendations

• The hyperbolic smoothing clustering method
• scientific article
• New local searches for solving the multi-source Weber problem
• The optimal solution set of the multi-source Weber problem
• scientific article; zbMATH DE number 679868

zbMATH Keywords

nondifferentiable programmingmultisource Weber problemmin-sum-distances clustering problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Continuous location (90B85)

Cites Work

• TSPLIB—A Traveling Salesman Problem Library
• A projection method for \(l_ p\) norm location-allocation problems
• Assignment Problems and the Location of Economic Activities
• Optimal covering of plane domains by circles via hyperbolic smoothing
• The hyperbolic smoothing clustering method
• Hyperbolic smoothing function method for minimax problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
• A hybrid data mining metaheuristic for the p‐median problem

Cited In (1)

• Hyperbolic regression: a new regression model with applications to the binary classification problem

Uses Software

• TSPLIB

This page was built for publication: A hyperbolic smoothing approach to the multisource Weber problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q740639)