Titlebook: Network Design with Applications to Transportation and Logistics; Teodor Gabriel Crainic,Michel Gendreau,Bernard Gen Book 2021 The Editor(

可擴(kuò)大

書目名稱Network Design with Applications to Transportation and Logistics影響因子(影響力)




書目名稱Network Design with Applications to Transportation and Logistics影響因子(影響力)學(xué)科排名




書目名稱Network Design with Applications to Transportation and Logistics網(wǎng)絡(luò)公開度




書目名稱Network Design with Applications to Transportation and Logistics網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Network Design with Applications to Transportation and Logistics被引頻次




書目名稱Network Design with Applications to Transportation and Logistics被引頻次學(xué)科排名




書目名稱Network Design with Applications to Transportation and Logistics年度引用




書目名稱Network Design with Applications to Transportation and Logistics年度引用學(xué)科排名




書目名稱Network Design with Applications to Transportation and Logistics讀者反饋




書目名稱Network Design with Applications to Transportation and Logistics讀者反饋學(xué)科排名

蒼白

CLOT

NEG

Heuristics and Metaheuristics for Fixed-Charge Network Designnetwork design problems. We also provide a historical perspective on the development of the field since the 1960’s, as well as a number of challenging research avenues for meta- and matheuristics for network design problems.

finite

Topology-Constrained Network Designrms of number of available node-disjoints paths, to allow re-routing in case of failures. To avoid delays in the networks, we also consider models where the length of paths is bounded, by introducing hop constraints or covering of the links by cycles of bounded lengths.

custody

Liner Shipping Network Designalgorithms where the service generation and the flowing of containers are separated into two steps. We conclude the chapter by discussing future trends in liner shipping, indicating directions for future research.

Decimate

簡潔

偏見

Fixed-Charge Network Design Problemst variants of network design problems and models, with various degrees of complexity. We identify a few basic modeling approaches in network design, including the use of path flow variables instead of arc flow variables, and the derivation of cut-set-based inequalities.

ARCH