Výsledky vyhledávání - "branch and bound algorithm"

Upřesnit hledání
  1. 1

    A two-phase optimization model for the demand-responsive customized bus network design Autor Huang, Di, Gu, Yu, Wang, Shuaian, Liu, Zhiyuan, Zhang, Wenbo

    ISSN: 0968-090X, 1879-2359
    Vydáno: Elsevier Ltd 01.02.2020
    “…•Propose an integrated decision-making framework for the demand-responsive customized bus network design.•Formulate the network design problem as a two-phase…”
    Získat plný text
    Journal Article
  2. 2

    Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach Autor Amodio, S., D’Ambrosio, A., Siciliano, R.

    ISSN: 0377-2217, 1872-6860
    Vydáno: Amsterdam Elsevier B.V 01.03.2016
    “…•An accurate heuristic solution to the median ranking problem is proposed.•The reference paradigm is the Kemeny–Snell axiomatic framework.•Simulation studies…”
    Získat plný text
    Journal Article
  3. 3

    A branch and bound algorithm for scheduling trains in a railway network Autor D’Ariano, Andrea, Pacciarelli, Dario, Pranzo, Marco

    ISSN: 0377-2217, 1872-6860
    Vydáno: Amsterdam Elsevier B.V 01.12.2007
    “…The paper studies a train scheduling problem faced by railway infrastructure managers during real-time traffic control. When train operations are perturbed, a…”
    Získat plný text
    Journal Article
  4. 4

    A branch-and-bound algorithm for solving the static rebalancing problem in bicycle-sharing systems Autor Kadri, Ahmed Abdelmoumene, Kacem, Imed, Labadi, Karim

    ISSN: 0360-8352, 1879-0550
    Vydáno: New York Elsevier Ltd 01.05.2016
    Vydáno v Computers & industrial engineering (01.05.2016)
    “…•We consider the vehicles scheduling problem in bicycle sharing systems.•We define and formulate a mathematical model to minimize both the operational cost and…”
    Získat plný text
    Journal Article
  5. 5

    Designing robust schedule coordination scheme for transit networks with safety control margins Autor Wu, Weitiao, Liu, Ronghui, Jin, Wenzhou

    ISSN: 0191-2615, 1879-2367
    Vydáno: Oxford Elsevier Ltd 01.11.2016
    “…We propose a robust schedule coordination scheme which combines timetable planning with a semi-flexible departure delayed control strategy in case of…”
    Získat plný text
    Journal Article
  6. 6
  7. 7

    Rebalancing the assembly lines: exact solution approaches Autor Sanci, Ece, Azizoglu, Meral

    ISSN: 0020-7543, 1366-588X
    Vydáno: London Taylor & Francis 18.10.2017
    “…In this study, we consider an assembly line rebalancing problem with disruptions caused by workstation breakdowns or shutdowns. After the disruption, we aim to…”
    Získat plný text
    Journal Article
  8. 8

    A branch and bound algorithm for single-machine production scheduling integrated with preventive maintenance planning Autor Wang, Shijin, Liu, Ming

    ISSN: 0020-7543, 1366-588X
    Vydáno: London Taylor & Francis Group 01.02.2013
    “…This paper deals with an integrated optimisation model for production scheduling and preventive maintenance (PM) in a single machine with its time to failure…”
    Získat plný text
    Journal Article
  9. 9

    A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts Autor Coniglio, Stefano, Furini, Fabio, San Segundo, Pablo

    ISSN: 0377-2217, 1872-6860
    Vydáno: Elsevier B.V 01.03.2021
    “…•A new efficient combinatorial branch and bound algorithm for solving the KPC is described.•Several bounding procedures based on different relaxations of the…”
    Získat plný text
    Journal Article
  10. 10

    An anytime branch and bound algorithm for agile earth observation satellite onboard scheduling Autor Chu, Xiaogeng, Chen, Yuning, Tan, Yuejin

    ISSN: 0273-1177, 1879-1948
    Vydáno: Elsevier Ltd 01.11.2017
    Vydáno v Advances in space research (01.11.2017)
    “…•We consider a bi-satellite cluster for targets recognition over sea.•We propose a mathematical model for the agile satellite scheduling problem.•We develop an…”
    Získat plný text
    Journal Article
  11. 11

    Flow shop scheduling with general position weighted learning effects to minimise total weighted completion time Autor Sun, Xinyu, Geng, Xin-Na, Liu, Feng

    ISSN: 0160-5682, 1476-9360
    Vydáno: Taylor & Francis 02.12.2021
    “…This article considers the flow shop problem of minimising the total weighted completion time in which the processing times of jobs are variable according to…”
    Získat plný text
    Journal Article
  12. 12

    Research on m‐machine flow shop scheduling with truncated learning effects Autor Wang, Ji‐Bo, Liu, Feng, Wang, Jian‐Jun

    ISSN: 0969-6016, 1475-3995
    Vydáno: Oxford Blackwell Publishing Ltd 01.05.2019
    “…The permutation flow shop problems with truncated exponential sum of logarithm processing times based and position‐based learning effects are considered in…”
    Získat plný text
    Journal Article
  13. 13

    Different due-window assignment scheduling with deterioration effects Autor Zhang, Yurong, Wang, Xi, Zhang, Li-Han, Jia, Xue, Wang, Ji-Bo

    ISSN: 1382-6905, 1573-2886
    Vydáno: New York Springer US 01.12.2024
    Vydáno v Journal of combinatorial optimization (01.12.2024)
    “…This paper studies a due-window assignment scheduling problem with deterioration effects on a single-machine. Under different due-window assignment, i.e., the…”
    Získat plný text
    Journal Article
  14. 14

    An exact algorithm for fleet co-deployment and slot co-chartering in a sustainable shipping alliance under emissions trading system Autor Wang, Yadong, Zhu, Shenghui, Iris, Çağatay

    ISSN: 0377-2217
    Vydáno: Elsevier B.V 01.12.2025
    “…•Emissions Trading System (ETS) impacts the operations of shipping companies and their alliances.•Integrated fleet operations planning, ship speed optimization…”
    Získat plný text
    Journal Article
  15. 15

    Type-II transfer line Balancing problem – A branch and bound approach Autor Ersin Telemeci, Yasin, Azizoğlu, Meral

    ISSN: 0360-8352
    Vydáno: Elsevier Ltd 01.12.2024
    Vydáno v Computers & industrial engineering (01.12.2024)
    “…•We address the Type II Transfer Line Balancing problem to minimize the cycle time.•A mixed integer programming model is developed, and a branch and bound…”
    Získat plný text
    Journal Article
  16. 16

    Joint optimization of train scheduling and routing in a coupled multi-resolution space–time railway network Autor Wang, Entai, Yang, Lixing, Li, Peiheng, Zhang, Chuntian, Gao, Ziyou

    ISSN: 0968-090X
    Vydáno: Elsevier Ltd 01.02.2023
    “…Train scheduling and routing are two critical and fundamental problems in the field of railway operations, especially under the large demand scenarios or…”
    Získat plný text
    Journal Article
  17. 17

    Globally Optimal Movable Antenna-Enabled Multiuser Communication: Discrete Antenna Positioning, Power Consumption, and Imperfect CSI Autor Wu, Yifei, Xu, Dongfang, Wing Kwan Ng, Derrick, Gerstacker, Wolfgang, Schober, Robert

    ISSN: 0090-6778, 1558-0857
    Vydáno: New York IEEE 01.10.2025
    Vydáno v IEEE transactions on communications (01.10.2025)
    “…Movable antennas (MAs) represent a promising paradigm to enhance the spatial degrees of freedom of conventional multi-antenna systems by dynamically adapting…”
    Získat plný text
    Journal Article
  18. 18

    Learning to Branch: Accelerating Resource Allocation in Wireless Networks Autor Lee, Mengyuan, Yu, Guanding, Li, Geoffrey Ye

    ISSN: 0018-9545, 1939-9359
    Vydáno: New York IEEE 01.01.2020
    “…Resource allocation in wireless networks, such as device-to-device (D2D) communications, is usually formulated as mixed integer nonlinear programming (MINLP)…”
    Získat plný text
    Journal Article
  19. 19

    Exact and heuristic solution approaches for the airport gate assignment problem Autor Karsu, Özlem, Azizoğlu, Meral, Alanlı, Kerem

    ISSN: 0305-0483, 1873-5274
    Vydáno: Elsevier Ltd 01.09.2021
    Vydáno v Omega (Oxford) (01.09.2021)
    “…•We consider a hierarchical airport gate assignment problem.•We first minimize the number of apron assignments.•We then minimize the total walking distance…”
    Získat plný text
    Journal Article
  20. 20

    Efficient Global Algorithms for Transmit Beamforming Design in ISAC Systems Autor Wu, Jiageng, Wang, Zhiguo, Liu, Ya-Feng, Liu, Fan

    ISSN: 1053-587X, 1941-0476
    Vydáno: IEEE 2024
    “…In this paper, we propose a MIMO transmit beamforming optimization model for joint radar sensing and multi-user communications, where the design of the…”
    Získat plný text
    Journal Article