Solution Algorithms for the Capacitated Location Tree Problem with Interconnections
This paper addresses the Capacitated Location Tree Problem with Interconnections, a new combinatorial optimization problem with applications in network design. In this problem, the required facilities picked from a set of potential facilities must be opened to serve customers using a tree-shaped net...
Saved in:
Main Authors: | Nidia Mendoza-Andrade, Efrain Ruiz-y-Ruiz, Suemi Rodriguez-Romo |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2025-01-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/18/1/50 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Employing Efficient Algorithms to Reduce the Distance Traveled in Location-Routing Problems Considering Travel and Service
by: Amir-Mohammad Golmohammadi, et al.
Published: (2022-05-01) -
Development of a robust multi-objective model for green capacitated location-routing under crisis conditions with time value of money
by: Shima Roosta, et al.
Published: (2023-09-01) -
Capacitated Multiple Allocation Hub Covering Flow Problem
by: Orhan Feyzioğlu, et al.
Published: (2021-06-01) -
A Framework for Tradeoff Between Location Privacy Preservation and Quality of Experience in Location Based Services
by: Tianyi Feng, et al.
Published: (2024-01-01) -
Substitute locations of urban spaces in films shot in Spain: motivations, representations and consequences
by: Víctor Aertsen, et al.
Published: (2022-12-01)