Pawnee Buttes: Synecdoche and Microcosm
- 期刊名称Great Plains Quarterly
- 作者Joeckel, R. M.
- 卷第34卷
- 期第3期
- 电子ISSN2333-5092
- 文件大小701.16KB
- 发表时间2014
- DOI10.1353/gpq.2014.0052
- 页码211-215
An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian RelaxationNiklas Kohl and Oli B. G. Madsen · Operations Research · 1997
An Evolutionary Scatter Search Particle Swarm Optimization Algorithm for the Vehicle Routing Problem With Time WindowsZhang, Jingtian; Yang, Fuxing; Weng, Xun · IEEE Access · 2018
An improved ant colony optimization algorithm for the multi-depot green vehicle routing problem with multiple objectivesLi, Yongbo; Soleimani, Hamed; Zohal, Mostafa · Journal of Cleaner Production · 2019
An optimization algorithm for solving the rich vehicle routing problem based on Variable Neighborhood Search and Tabu Search metaheuristicsSicilia, Juan Antonio; Quemada, Carlos; Royo, Beatriz; Escuín, David · Journal of Computational and Applied Mathematics · 2015
[Lecture Notes in Computer Science] Evolutionary Computation in Combinatorial Optimization Volume 7245 || An NSGA-II Algorithm for the Green Vehicle Routing ProblemHao, Jin-Kao; Middendorf, Martin · 2012
[IEEE 2017 International Colloquium on Logistics and Supply Chain Management (LOGISTIQUA) - Rabat, Morocco (2017.4.27-2017.4.28)] 2017 International Colloquium on Logistics and Supply Chain Management (LOGISTIQUA) - An ant colony optimization algorithm for solving the full truckload vehicle routing problem with profitBouyahyiouy, Karim El; Bellabdaoui, Adil · 2017
[IEEE 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS) - Orlando, FL, USA (2014.12.9-2014.12.12)] 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS) - An improved optimization method based on the intelligent water drops algorithm for the vehicle routing problemBooyavi, Zahra; Teymourian, Ehsan; Komaki, G.M.; Sheikh, S. · 2014
An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian RelaxationNiklas Kohl and Oli B. G. Madsen · Operations Research · 1997
Focused Issue on Maritime Transportation || 2-Path Cuts for the Vehicle Routing Problem with Time WindowsNIKLAS KOHL, JACQUES DESROSIERS, OLI B. G. MADSEN, MARIUS M. SOLOMON and FRANÇOIS SOUMIS · Transportation Science · 1999
Test sets of integer programsRobert Weismantel · Mathematical Methods of Operations Research (ZOR) · 1998
Inverse problem of minimum cutsJianzhong Zhang; Mao -Cheng Cai · Mathematical Methods of Operations Research (ZOR) · 1998
Thek-partitioning problemLuitpold Babel; Hans Kellerer; Vladimir Kotov · Mathematical Methods of Operations Research (ZOR) · 1998
Book reviewsPetra Huh; Horst W. Hamacher · Mathematical Methods of Operations Research (ZOR) · 1998
Restricted component additive gamesImma Curiel; Herbert Hamers; Stef Tijs; Jos Potters · Mathematical Methods of Operations Research (ZOR) · 1997
Inverse Matroid Intersection ProblemCai Mao-Cheng; Yanjun Li · Mathematical Methods of Operations Research (ZOR) · 1997
Book reviewsE. Schaich; H. Volger; Fredi Tröltzsch · Mathematical Methods of Operations Research (ZOR) · 1997
Book reviewsJ. Zimmermann; Hans Daduna · Mathematical Methods of Operations Research (ZOR) · 1996