Using dual network bounds in algorithms for solving generalized set packing/partitioning problems
type: Item
instance of: scholarly article
title: Using dual network bounds in algorithms for solving generalized set packing/partitioning problems
zbMATH Open document ID: 0865.90097
DOI: 10.1007/BF00247796
author: V. M. Glushkov
author: N. Z. Shor
author: Yu. V. Voĭtishin
published in: Computational Optimization and Applications
publication date: 1996-12-15T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 941247
zbMATH Keywords: dual bounds
zbMATH Keywords: approximate solutions
zbMATH Keywords: generalized set packing/partitioning problems
zbMATH Keywords: branch-and-bound
zbMATH Keywords: network relaxation
MaRDI profile type: Publication
cites work: Set Partitioning: A survey
cites work: Elements of Large-Scale Mathematical Programming Part I: Concepts
cites work: On the Computational Complexity of Combinatorial Problems
cites work: An Algorithm for Large Set Partitioning Problems
cites work: Optimal set partitioning, matchings and lagrangian duality
cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs
cites work: Q5187067
cites work: Algorithms for solving a problem on the largest set of pairwise incomparable weighted vertices of a directed graph without circuits.
description: scientific article; zbMATH DE number 941247