Treffer: Clustering and Multifacility Location with Constraints via Distance Function Penalty Methods and DC Programming
Title:
Clustering and Multifacility Location with Constraints via Distance Function Penalty Methods and DC Programming
Authors:
Source:
Student Research Symposium
Publisher Information:
PDXScholar
Publication Year:
2018
Collection:
Portland State University: PDXScholar
Subject Terms:
Document Type:
Fachzeitschrift
text
File Description:
application/pdf
Language:
unknown
Relation:
Availability:
Rights:
© Copyright the author(s) IN COPYRIGHT: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s). DISCLAIMER: The purpose of this statement is to help the public understand how this Item may be used. When there is a (non-standard) License or contract that governs re-use of the associated Item, this statement only summarizes the effects of some of its terms. It is not a License, and should not be used to license your Work. To license your own Work, use a License offered at https://creativecommons.org/
Accession Number:
edsbas.565079D3
Database:
BASE
Weitere Informationen
This is a continuation of our effort in using mathematical optimization involving DC programming in clustering and multifacility location. We study a penalty method based on distance functions and apply it particularly to a number of problems in clustering and multi- facility location in which the centers to be found must lie in some given set constraints. We also provide numerical examples to test our method.