1–20 von 100 Ergebnissen
|

    Bi-objective optimization of a multiple-target active debris removal mission

    Bérend, Nicolas / Olive, Xavier | Elsevier | 2016
    Schlagwörter: Branch and Bound

    Determination of infrastructure capacity in railway networks without the need for a fixed timetable

    Jensen, Lars Wittrup / Schmidt, Marie / Nielsen, Otto Anker | Elsevier | 2020
    Schlagwörter: Branch-and-bound

    The reliable hub-and-spoke design problem: Models and algorithms

    An, Yu / Zhang, Yu / Zeng, Bo | Elsevier | 2015
    Schlagwörter: Branch-and-Bound

    Šakų ir rėžių lygiagrečiųjų algoritmų analizė ir taikymai ; Analysis and practice of parallel branch and bound algorithms

    Freier Zugriff
    Stalbovskyi, Heorhii | BASE | 2016
    Schlagwörter: Branch and Bound method

    Efficient airplane arrival scheduling using a set partitioning-based branch-and-price method

    Song, Jae-Hoon / Choi, Han-Lim | SAGE Publications | 2018
    Schlagwörter: branch and bound , branch and price

    Designing robust schedule coordination scheme for transit networks with safety control margins

    Wu, Weitiao / Liu, Ronghui / Jin, Wenzhou | Elsevier | 2016
    Schlagwörter: Branch-and-bound algorithm

    Optimizing freight rate of spot market containers with uncertainties in shipping demand and available ship capacity

    Wang, Yadong / Meng, Qiang | Elsevier | 2021
    Schlagwörter: Spatial branch and bound

    Machine learning-driven algorithms for the container relocation problem

    Zhang, Canrong / Guan, Hao / Yuan, Yifei et al. | Elsevier | 2020
    Schlagwörter: branch-and-bound algorithm

    Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds

    Zhou, Xuesong / Zhong, Ming | Elsevier | 2006
    Schlagwörter: Branch and bound

    Optimizing the demand captured by a railway system with a regular timetable

    Cordone, Roberto / Redaelli, Francesco | Elsevier | 2010
    Schlagwörter: Branch-and-bound

    Transportation service procurement problem with transit time

    Hu, Qian / Zhang, Zhenzhen / Lim, Andrew | Elsevier | 2016
    Schlagwörter: Biobjective branch-and-bound

    Designing corridor systems with modular autonomous vehicles enabling station-wise docking: Discrete modeling method

    Chen, Zhiwei / Li, Xiaopeng | Elsevier | 2021
    Schlagwörter: Customized branch and bound

    Scheduling of airport runway operations using stochastic branch and bound methods

    Sölveling, Gustaf / Clarke, John-Paul | Elsevier | 2014
    Schlagwörter: Stochastic branch-and-bound algorithm

    A two-phase optimization model for the demand-responsive customized bus network design

    Huang, Di / Gu, Yu / Wang, Shuaian et al. | Elsevier | 2019
    Schlagwörter: Branch-and-bound algorithm

    A stochastic program approach for path reconstruction oriented sensor location model

    Fu, Chenyi / Zhu, Ning / Ma, Shoufeng | Elsevier | 2017
    Schlagwörter: Branch and bound based integer L-shaped algorithm , Confidence bound

    Service interruption and customer withdrawal in the congested facility location problem

    Zamani, Shokufeh / Arkat, Jamal / Niaki, Seyed Taghi Akhavan | Elsevier | 2022
    Schlagwörter: Branch and Bound Algorithm

    Competitive and cooperative behaviour analysis of connected and autonomous vehicles across unsignalised intersections: A game-theoretic approach

    Wang, Hua / Meng, Qiang / Chen, Shukai et al. | Elsevier | 2021
    Schlagwörter: Connected and autonomous vehicles , Branch & bound algorithm

    An anytime branch and bound algorithm for agile earth observation satellite onboard scheduling

    Chu, Xiaogeng / Chen, Yuning / Tan, Yuejin | Elsevier | 2017
    Schlagwörter: Anytime branch and bound algorithm

    Quay crane scheduling with draft and trim constraints

    Wu, Lingxiao / Ma, Weimin | Elsevier | 2016
    Schlagwörter: Draft and trim constraints , Branch and bound

    Joint optimization of train scheduling and routing in a coupled multi-resolution space–time railway network

    Wang, Entai / Yang, Lixing / Li, Peiheng et al. | Elsevier | 2022
    Schlagwörter: Branch-and-bound algorithm