Using dual network bounds in algorithms for solving generalized set packing/partitioning problems

DOI10.1007/BF00247796zbMath0865.90097MaRDI QIDQ1814995

V. M. Glushkov, Yu. V. Voĭtishin, Naum Z. Shor

Publication date: 15 December 1996

Published in: Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

approximate solutionsbranch-and-bounddual boundsnetwork relaxationgeneralized set packing/partitioning problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Integer programming (90C10)

Related Items (1)

The matching relaxation for a class of generalized set partitioning problems

Cites Work

• Unnamed Item
• Algorithms for solving a problem on the largest set of pairwise incomparable weighted vertices of a directed graph without circuits.
• Optimal set partitioning, matchings and lagrangian duality
• An Algorithm for Large Set Partitioning Problems
• On the Computational Complexity of Combinatorial Problems
• Set Partitioning: A survey
• Transitive Orientation of Graphs and Identification of Permutation Graphs
• Elements of Large-Scale Mathematical Programming Part I: Concepts

This page was built for publication: Using dual network bounds in algorithms for solving generalized set packing/partitioning problems