AN IMPROVED LOWER BOUND TO THE MINIMUM FLEET SIZE PROBLEM

被引:20
|
作者
STERN, HI
CEDER, A
机构
[1] BEN GURION UNIV NEGEV,IL-84120 BEERSHEBA,ISRAEL
[2] TECHNION ISRAEL INST TECHNOL,HAIFA,ISRAEL
[3] UNIV CALIF BERKELEY,INST TRANSPORTAT STUDIES,BERKELEY,CA 94720
关键词
D O I
10.1287/trsc.17.4.471
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:471 / 477
页数:7
相关论文
共 50 条
  • [22] An improved lower bound for approximating minimum GCD multiplier in l∞ norm (GCDM∞)
    Chen, WenBin
    Meng, Jiangtao
    Yin, Dengpan
    [J]. THEORETICAL COMPUTER SCIENCE, 2008, 396 (1-3) : 1 - 9
  • [23] A Column Generation-Based Lower Bound for the Minimum Sum Coloring Problem
    Mrad, Mehdi
    Harrabi, Olfa
    Siala, Jouhaina Chaouachi
    Gharbi, Anis
    [J]. IEEE ACCESS, 2020, 8 : 57891 - 57904
  • [24] AN IMPROVED LOWER BOUND ON THE SIZE OF KAKEYA SETS OVER FINITE FIELDS
    Saraf, Shubhangi
    Sudan, Madhu
    [J]. ANALYSIS & PDE, 2008, 1 (03): : 375 - 379
  • [25] Lower bound on size of branch-and-bound trees for solving lot-sizing problem
    Dey, Santanu S.
    Shah, Prachi
    [J]. OPERATIONS RESEARCH LETTERS, 2022, 50 (05) : 430 - 433
  • [26] A fast branch-and-bound algorithm with an improved lower bound for solving the multiprocessor scheduling problem
    Fujita, S
    Masukawa, M
    Tagashira, S
    [J]. NINTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 2002, : 611 - 616
  • [27] MAXIMUM MILEAGE FROM MINIMUM-SIZE FLEET
    不详
    [J]. AMERICAN DAIRY REVIEW, 1973, 35 (05): : 18 - 18
  • [28] A network-flow-based lower bound for the minimum weighted integer coloring problem
    Xue, J
    Liu, J
    [J]. INFORMATION PROCESSING LETTERS, 2000, 76 (1-2) : 45 - 50
  • [29] AN IMPROVED BL LOWER BOUND
    BROWN, DJ
    [J]. INFORMATION PROCESSING LETTERS, 1980, 11 (01) : 37 - 39
  • [30] Improved Lower Bound for A General Case of The Master-plate Design Problem
    Xie, Xie
    Li, Yanping
    Zheng, Yongyue
    [J]. PROCEEDING OF THE IEEE INTERNATIONAL CONFERENCE ON INFORMATION AND AUTOMATION, 2012, : 856 - 860