SET COVERING AND SET PARTITIONING - A COLLECTION OF TEST PROBLEMS

被引：9
|
作者：
ELDARZI, E
MITRA, G
机构：
[1] BRUNEL UNIV, DEPT MATH & STAT, UXBRIDGE UB8 3PH, MIDDX, ENGLAND
[2] POLYTECH CENT LONDON, LONDON W1M 8JS, ENGLAND
来源：
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | 1990年 / 18卷 / 02期
关键词：
crew scheduling; integer programming; linear programming; set covering; set partitioning; vehicle scheduling;
D O I：
10.1016/0305-0483(90)90066-I
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
It is now well established that set covering and set partitioning models play a central role in many scheduling applications. There are many algorithms which solve these problems. In order to test and validate implementations of such algorithms we have collected a range of test problems taken from different contexts. A brief description of these models, their applications and summary model data, are supplied in this paper. © 1990.
引用
收藏
页码：195 / 201
页数：7
相关论文
共 50 条
  • [1] Relation between set covering and set partitioning problems
    Saxena, RR
    Arora, SR
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 1997, 28 (07): : 865 - 876
  • [2] GRAPH-THEORETIC RELAXATIONS OF SET COVERING AND SET PARTITIONING PROBLEMS
    ELDARZI, E
    MITRA, G
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 87 (01) : 109 - 121
  • [3] SOLUTION OF SET-COVERING AND SET-PARTITIONING PROBLEMS USING ASSIGNMENT RELAXATIONS
    ELDARZI, E
    MITRA, G
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1992, 43 (05) : 483 - 493
  • [4] Relation between set partitioning and set covering problems with quadratic fractional objective functions
    Shanker R.
    Arora S.R.
    Saxena R.R.
    OPSEARCH, 2011, 48 (3) : 247 - 256
  • [5] A new ACO transition rule for Set Partitioning and Covering Problems
    Crawford, Broderick
    Castro, Carlos
    Monfroy, Eric
    2009 INTERNATIONAL CONFERENCE OF SOFT COMPUTING AND PATTERN RECOGNITION, 2009, : 426 - +
  • [6] SET-PARTITIONING PROBLEM - SET COVERING WITH EQUALITY CONSTRAINTS
    GARFINKEL, RS
    NEMHAUSER, GL
    OPERATIONS RESEARCH, 1969, 17 (05) : 848 - +
  • [7] OPTIMAL SOLUTION OF SET COVERING PARTITIONING PROBLEMS USING DUAL HEURISTICS
    FISHER, ML
    KEDIA, P
    MANAGEMENT SCIENCE, 1990, 36 (06) : 674 - 688
  • [8] Reoptimization of set covering problems
    Mikhailyuk V.A.
    Cybernetics and Systems Analysis, 2010, 46 (6) : 879 - 883
  • [9] SET-COVERING PROBLEM .2. ALGORITHM FOR SET PARTITIONING
    BALAS, E
    PADBERG, M
    OPERATIONS RESEARCH, 1975, 23 (01) : 74 - 90
  • [10] On applying set covering models to test set compaction
    Flores, PF
    Neto, HC
    Marques-Silva, JP
    NINTH GREAT LAKES SYMPOSIUM ON VLSI, PROCEEDINGS, 1999, : 8 - 11
12345