Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations
From MaRDI portal
Publication:4018535
DOI10.1057/jors.1992.74zbMath0767.90053OpenAlexW2087785683MaRDI QIDQ4018535
Publication date: 16 January 1993
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1992.74
branch and bounddiscrete optimizationset-partitioningset-coveringtree search algorithmsassignment relaxationsgraph theoretic relaxations
Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80)
Related Items
A packet filter placement problem with application to defense against spoofed denial of service attacks, Solving hard set covering problems, Graph theoretic relaxations of set covering and set partitioning problems, An adaptation of SH heuristic to the location set covering problem, OPTIMAL SET-PARTITIONING BASED ON GROUP QUALITY LIKELIHOOD USING PARTITION-GROWING ALGORITHM