Repositorio de producción científica de la Universidad de Sevilla

Location problems with multiple criteria

 

Advanced Search
 
Opened Access Location problems with multiple criteria
Cites

Show item statistics
Icon
Export to
Author: Nickel, Stefan
Puerto Albandoz, Justo
Rodríguez Chía, Antonio Manuel
Coordinator/Director: Laporte, Gilbert
Nickel, Stefan
Saldanha da Gama, Francisco
Department: Universidad de Sevilla. Departamento de Estadística e Investigación Operativa
Date: 2015
Published in: Location science
ISBN/ISSN: 9783319131108
9783319131115
Document type: Chapter of Book
Abstract: This chapter analyzes multicriteria continuous, network, and discrete location problems. In the continuous framework, we provide a complete description of the set of weak Pareto, Pareto, and strict Pareto locations for a general Q-criteria location problem based on the characterization of three criteria problems. In the network case, the set of Pareto locations is characterized for general networks as well as for tree networks using the concavity and convexity properties of the distance function on the edges. In the discrete setting, the entire set of Pareto locations is characterized using rational generating functions of integer points in polytopes. Moreover, we describe algorithms to obtain the solutions sets (the different Pareto locations) using the above characterizations. We also include a detailed complexity analysis. A number of references has been cited throughout the chapter to avoid the inclusion of unnecessary technical details and also to be useful for a deeper analysis.
Size: 334.4Kb
Format: PDF

URI: http://hdl.handle.net/11441/48875

DOI: 10.1007/978-3-319-13111-5_9

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)