SOLUTION OF SET-COVERING AND SET-PARTITIONING PROBLEMS USING ASSIGNMENT RELAXATIONS

被引：0
|
作者：
ELDARZI, E
MITRA, G
机构：
[1] BRUNEL UNIV,DEPT MATH & STAT,UXBRIDGE UB8 3PH,MIDDX,ENGLAND
[2] POLYTECH CENT LONDON,DIV MATH & DECIS SCI,LONDON W1M 8JS,ENGLAND
来源：
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 1992年 / 43卷 / 05期
关键词：
INTEGER PROGRAMMING; DISCRETE OPTIMIZATION; SET COVERING; SCHEDULING; ASSIGNMENT; BRANCH AND BOUND;
D O I：
暂无
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
Graph theoretic relaxations are used to design tree search algorithms for set-covering and set-partitioning problems. In this paper two assignment relaxations for the set-covering and set-partitioning problems are presented and a tree search method is developed which makes use of these relaxations. Computational experience of processing a collection of test problems is reported.
引用
收藏
页码：483 / 493
页数：11
相关论文
共 50 条
12345