On λ-Cent-Dians and Generalized-Center for Network Design: Definitions and Properties
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909649412816896 |
|---|---|
| author | Bucarey, Víctor González-Blanco, Natividad Labbé, Martine Mesa, Juan A. |
| author_facet | Bucarey, Víctor González-Blanco, Natividad Labbé, Martine Mesa, Juan A. |
| contents | In this paper, we extend the notions of $λ$-cent-dian and generalized-center from Facility Location Theory to the more intricate domain of Network Design. Our focus is on the task of designing a sub-network within a given underlying network while adhering to a budget constraint. This sub-network is intended to efficiently serve a collection of origin/destination pairs of demand.
The $λ$-cent-dian problem studies the balance between efficiency and equity. We investigate the properties of the $λ$-cent-dian and generalized-center solution networks under the lens of equity, efficiency, and Pareto-optimality. We finally prove that the problems solved here are NP-hard. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_12673 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On λ-Cent-Dians and Generalized-Center for Network Design: Definitions and Properties Bucarey, Víctor González-Blanco, Natividad Labbé, Martine Mesa, Juan A. Optimization and Control In this paper, we extend the notions of $λ$-cent-dian and generalized-center from Facility Location Theory to the more intricate domain of Network Design. Our focus is on the task of designing a sub-network within a given underlying network while adhering to a budget constraint. This sub-network is intended to efficiently serve a collection of origin/destination pairs of demand. The $λ$-cent-dian problem studies the balance between efficiency and equity. We investigate the properties of the $λ$-cent-dian and generalized-center solution networks under the lens of equity, efficiency, and Pareto-optimality. We finally prove that the problems solved here are NP-hard. |
| title | On λ-Cent-Dians and Generalized-Center for Network Design: Definitions and Properties |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2401.12673 |