TRANSFORMATION OF SET PARTITIONING PROBLEM INTO A MAXIMUM WEIGHTED STABLE SET PROBLEM

被引：0
|
作者：
BILLIONNET, A
机构：
来源：
RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH | 1978年 / 12卷 / 03期
关键词：
D O I：
暂无
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：319 / 323
页数：5
相关论文
共 50 条
  • [31] FREQUENCY PLANNING AS A SET PARTITIONING PROBLEM
    THUVE, H
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1981, 6 (01) : 29 - 37
  • [32] Genetic algorithm for the set partitioning problem
    Levine, David M.
    Australian Electronics Engineering, 1994, 27 (02):
  • [33] ALGORITHM FOR COMPLETE SET PARTITIONING PROBLEM
    SALKIN, HM
    LIN, CH
    OPERATIONS RESEARCH, 1975, 23 : B389 - B389
  • [34] SET-PARTITIONING PROBLEM - SET COVERING WITH EQUALITY CONSTRAINTS
    GARFINKEL, RS
    NEMHAUSER, GL
    OPERATIONS RESEARCH, 1969, 17 (05) : 848 - +
  • [35] An algorithm for the weighted stable set problem in claw-free graphs with
    Nobili, Paolo
    Sassano, Antonio
    MATHEMATICAL PROGRAMMING, 2017, 164 (1-2) : 157 - 165
  • [36] Looking for the Maximum Independent Set: A New Perspective on the Stable Path Problem
    Cheng, Yichao
    Luo, Ning
    Zhang, Jingxuan
    Antonopoulos, Timos
    Piskac, Ruzica
    Xiang, Qiao
    IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2021), 2021,
  • [37] A branch-and-cut algorithm for the maximum cardinality stable set problem
    Rossi, F
    Smriglio, S
    OPERATIONS RESEARCH LETTERS, 2001, 28 (02) : 63 - 74
  • [38] A generalization of the weighted set covering problem
    Yang, J
    Leung, JYT
    NAVAL RESEARCH LOGISTICS, 2005, 52 (02) : 142 - 149
  • [39] SET-COVERING PROBLEM .2. ALGORITHM FOR SET PARTITIONING
    BALAS, E
    PADBERG, M
    OPERATIONS RESEARCH, 1975, 23 (01) : 74 - 90
  • [40] A primal approach to the stable set problem
    Gentile, C
    Haus, UU
    Köppe, M
    Rinaldi, G
    Weismantel, R
    ALGORITHMS-ESA 2002, PROCEEDINGS, 2002, 2461 : 525 - 537
12345