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 条
  • [41] Robust Algorithms for the Stable Set Problem
    Michael U. Gerber
    Vadim V. Lozin
    Graphs and Combinatorics, 2003, 19 : 347 - 356
  • [42] A set partitioning approach to the crew scheduling problem
    Mingozzi, A
    Boschetti, MA
    Ricciardelli, S
    Bianco, L
    OPERATIONS RESEARCH, 1999, 47 (06) : 873 - 888
  • [43] A SET PARTITIONING HEURISTIC FOR THE GENERALIZED ASSIGNMENT PROBLEM
    CATTRYSSE, DG
    SALOMON, M
    VANWASSENHOVE, LN
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 72 (01) : 167 - 174
  • [44] A MULTIPLIER ADJUSTMENT APPROACH FOR THE SET PARTITIONING PROBLEM
    CHAN, TJ
    YANO, CA
    OPERATIONS RESEARCH, 1992, 40 : S40 - S47
  • [45] Robust algorithms for the stable set problem
    Gerber, MU
    Lozin, VV
    GRAPHS AND COMBINATORICS, 2003, 19 (03) : 347 - 356
  • [46] The stable set problem and the thinness of a graph
    Mannino, Carlo
    Oriolo, Gianpaolo
    Ricci, Federico
    Chandran, Sunil
    OPERATIONS RESEARCH LETTERS, 2007, 35 (01) : 1 - 9
  • [47] The query clustering problem: A set partitioning approach
    Gopal, RD
    Ramesh, R
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1995, 7 (06) : 885 - 899
  • [48] Integral column generation for the set partitioning problem
    Tahir, Adil
    Desaulniers, Guy
    El Hallaoui, Issmail
    EURO JOURNAL ON TRANSPORTATION AND LOGISTICS, 2019, 8 (05) : 713 - 744
  • [49] AN EFFICIENT ALGORITHM FOR THE COMPLETE SET PARTITIONING PROBLEM
    LIN, CHM
    SALKIN, HM
    DISCRETE APPLIED MATHEMATICS, 1983, 6 (02) : 149 - 156
  • [50] A SEQUENTIAL AGGREGATION ALGORITHM FOR THE SET PARTITIONING PROBLEM
    NOUH, A
    COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 1987, 63 (03) : 225 - 232
12345