Capacitated Multiple Allocation Hub Covering Flow Problem
The aim of the Capacitated Multiple Allocation Hub Covering Flow Problem is to find theoptimal design for hub-and-spoke networks while taking into account hub opening and demandrouting costs. Every network node has the potential to be a hub and demand from an origin to adestination must be sent thro...
Saved in:
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Kyrgyz Turkish Manas University
2021-06-01
|
Series: | MANAS: Journal of Engineering |
Subjects: | |
Online Access: | https://dergipark.org.tr/en/download/article-file/1342603 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|