AN EASY LOWER BOUND ON THE NUMBER OF TRUCKS NEEDED TO SERVICE A SET OF DESTINATIONS

被引:1
|
作者
WHITE, GP
机构
来源
关键词
D O I
10.1016/0305-0483(80)90066-3
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:385 / 387
页数:3
相关论文
共 50 条
  • [1] A GENERAL LOWER BOUND ON THE NUMBER OF EXAMPLES NEEDED FOR LEARNING
    EHRENFEUCHT, A
    HAUSSLER, D
    KEARNS, M
    VALIANT, L
    INFORMATION AND COMPUTATION, 1989, 82 (03) : 247 - 261
  • [2] A Lower Bound for the Number of Pinned Angles Determined by a Cartesian Product Set
    Oliver Roche-Newton
    Combinatorica, 2025, 45 (2)
  • [3] The lower bound on independence number
    李雨生
    CecilC.ROUSSEAU
    臧文安
    Science China Mathematics, 2002, (01) : 64 - 69
  • [4] A Lower Bound on Unknotting Number
    JIMING MA RUIFENG QIU Institute of Mathematics
    Chinese Annals of Mathematics, 2006, (04) : 437 - 440
  • [5] The lower bound on independence number
    Yusheng Li
    Cecil C. Rousseau
    Wen’an Zang
    Science in China Series A: Mathematics, 2002, 45 (1): : 64 - 69
  • [6] A Lower Bound on Unknotting Number*
    Jiming Ma
    Ruifeng Qiu
    Chinese Annals of Mathematics, Series B, 2006, 27 : 437 - 440
  • [7] The lower bound on independence number
    Li, YS
    Rousseau, CC
    Zang, W
    SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY, 2002, 45 (01): : 64 - 69
  • [8] A lower bound on unknotting number
    Ma, Jiming
    Qiu, Ruifeng
    CHINESE ANNALS OF MATHEMATICS SERIES B, 2006, 27 (04) : 437 - 440
  • [9] Lower bound on independence number
    Li, Yusheng
    Rousseau, Cecil C.
    Zang, Wen'an
    Science in China, Series A: Mathematics, Physics, Astronomy, 2002, 45 (01):
  • [10] Easy lower bound for a strange computational model
    Smolensky, R
    COMPUTATIONAL COMPLEXITY, 1997, 6 (03) : 213 - 216