Locating postal relay boxes using a set covering algorithm

被引：0
|
作者：
Bouliane, Jocelyn
Laporte, Gilbert
机构：
来源：
American Journal of Mathematical and Management Sciences | 1992年 / 12卷 / 01期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] Covering a Set of Points with k Bounding Boxes
    Sepulveda, Carlos S.
    Rodriguez, Andrea
    Seco, Diego
    2019 38TH INTERNATIONAL CONFERENCE OF THE CHILEAN COMPUTER SCIENCE SOCIETY (SCCC), 2019,
  • [2] AN ALGORITHM FOR LOCATING CANDIDATE LABELING BOXES WITHIN A POLYGON
    VANROESSEL, JW
    AMERICAN CARTOGRAPHER, 1989, 16 (03): : 201 - 209
  • [3] AN ALGORITHM FOR SET COVERING PROBLEM
    BEASLEY, JE
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1987, 31 (01) : 85 - 93
  • [4] Covering a set of points by two axis-parallel boxes
    Bespamyatnikh, S
    Segal, M
    INFORMATION PROCESSING LETTERS, 2000, 75 (03) : 95 - 100
  • [5] APPLICATION OF SET COVERING LOCATION PROBLEM FOR ORGANIZING THE PUBLIC POSTAL NETWORK
    Sarac, Dragana
    Kopic, Milos
    Mostarac, Katarina
    Kujacic, Momcilo
    Jovanovic, Bojan
    PROMET-TRAFFIC & TRANSPORTATION, 2016, 28 (04): : 403 - 413
  • [6] Crawling Deep Web Using a New Set Covering Algorithm
    Wang, Yan
    Lu, Jianguo
    Chen, Jessica
    ADVANCED DATA MINING AND APPLICATIONS, PROCEEDINGS, 2009, 5678 : 326 - 337
  • [7] Set-Covering-based Algorithm for Delay Constrained Relay Node Placement in Wireless Sensor Networks
    Ma, Chaofan
    Liang, Wei
    Zheng, Meng
    2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2016,
  • [8] A genetic algorithm for the set covering problem
    Beasley, JE
    Chu, PC
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 94 (02) : 392 - 404
  • [9] ALGORITHM FOR SET-COVERING PROBLEMS
    GONDRAN, M
    LAURIERE, JL
    REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1975, (NV2): : 33 - 51
  • [10] ENHANCING AN ALGORITHM FOR SET COVERING PROBLEMS
    BEASLEY, JE
    JORNSTEN, K
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 58 (02) : 293 - 300
12345