Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Farah Zeghal Mansour"'
Publikováno v:
Engineering Optimization. 52:507-526
This article addresses a variant of the Discrete Cost Multicommodity Flow (DCMF) problem with random demands, where a penalty is incurred for each unrouted demand. The problem requires finding a network topology that minimizes the sum of the fixed in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e98564cfb2f2f55cae0a4dbd308af12
https://doi.org/10.1080/0305215x.2019.1603299
https://doi.org/10.1080/0305215x.2019.1603299
Publikováno v:
International Journal of Computing and Digital Systems. 8:659-668
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c67fa8f8efccc4fc32a14518eafa6067
https://doi.org/10.12785/ijcds/080613
https://doi.org/10.12785/ijcds/080613
Publikováno v:
Journal of Air Transport Management. 73:15-31
Given a daily flight schedule and a set of aircraft fleets, the integrated aircraft routing and crew scheduling problem requires finding a maintenance feasible set of aircraft routes and crew pairings such that each individual flight is covered by ex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ec3a17dfdc9fc319df8e2a11418bdf36
https://doi.org/10.1016/j.jairtraman.2018.07.007
https://doi.org/10.1016/j.jairtraman.2018.07.007
Publikováno v:
CoDIT
We investigate the Network Loading Problem (NLP) where a set of multicommodity demands (traffic) should be routed between pairs of nodes (customers). The problem consists of designing a network by installing capacities that allow simultaneous transmi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c09819dc39257e86beb68864a0cef064
https://doi.org/10.1109/codit.2019.8820474
https://doi.org/10.1109/codit.2019.8820474
We investigate the Multicommodity Network Optimization Problem with a Step Cost Function (MNOP-SCF) where the available facilities to be installed on the edges have discrete step-increasing cost and capacity functions. This strategic long-term planni
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::97aa4cdbdb1a7bc85bd59f5f74313bdb
https://hdl.handle.net/10576/13963
https://hdl.handle.net/10576/13963
The daily crew pairing problem (DCPP) seeks to generate a set of minimal-cost pairings that covers all the planned daily flights while complying with a variety of labor regulations, safety rules, and policies of the airline. The DCPP is a highly comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb7a5461981c87bab75f1e4e5e07cb76
https://hdl.handle.net/10576/13774
https://hdl.handle.net/10576/13774
Publikováno v:
2018 International Conference on Innovation and Intelligence for Informatics, Computing, and Technologies (3ICT).
Multicommodity Network Design problems are a challenging class of problems that arises in the strategic and tactical planning processes and has many applications mainly in the fields of telecommunication and supply chain. Thus, solving this interesti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c18e158f069e4a801eca1ef47d18d82f
https://doi.org/10.1109/3ict.2018.8855755
https://doi.org/10.1109/3ict.2018.8855755
Publikováno v:
Transportation research. Part C, Emerging technologies
Transportation research. Part C, Emerging technologies, Elsevier, 2013, 32, ⟨10.1016/j.trc.2013.03.008⟩
Transportation research. Part C, Emerging technologies, Elsevier, 2013, 32, ⟨10.1016/j.trc.2013.03.008⟩
Airlines schedules are often subject to various uncontrollable factors that cause disruptions and delays. These delays not only constitute, for many passengers, the painful part of air travel, but also represent for airlines a significant financial b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5dcccb0d6d1d447b39a57001587c500c
https://doi.org/10.1016/j.trc.2013.03.008
https://doi.org/10.1016/j.trc.2013.03.008
Publikováno v:
Health care management science. 21(3)
This paper deals with an Integrated Elective Surgery-Scheduling Problem (IESSP) that arises in a privately operated healthcare facility. It aims to optimize the resource utilization of the entire surgery process including pre-operative, per-operative
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::69af756d2549b7ac005015aca556bc6a
https://pubmed.ncbi.nlm.nih.gov/27817060
https://pubmed.ncbi.nlm.nih.gov/27817060
Publikováno v:
Computational Optimization and Applications. 49:213-239
Due to copyright restrictions, the access to the full text of this article is only available via subscription. We describe models and exact solutions approaches for an integrated aircraft fleeting and routing problem arising at TunisAir. Given a sche
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1aa591da3f37b3327cde2e213de0aa81
https://doi.org/10.1007/s10589-009-9292-z
https://doi.org/10.1007/s10589-009-9292-z