A network relaxation based enumeration algorithm for set partitioning

DOI10.1016/0377-2217(89)90471-2zbMath0676.90045OpenAlexW1977728361MaRDI QIDQ1123128

Hemalatha Thiagarajan, Agha Iqbal Ali

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90471-2

zbMATH Keywords

enumerationset partitioningtotal unimodularity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Boolean programming (90C09)

Related Items (8)

The matching relaxation for a class of generalized set partitioning problems ⋮ A binary cat swarm optimization algorithm for the non-unicost set covering problem ⋮ Graph theoretic relaxations of set covering and set partitioning problems ⋮ Use of hidden network structure in the set partitioning problem ⋮ Enhancing an algorithm for set covering problems ⋮ Genetic clustering algorithms. ⋮ Algorithms for large scale set covering problems ⋮ OPTIMAL SET-PARTITIONING BASED ON GROUP QUALITY LIKELIHOOD USING PARTITION-GROWING ALGORITHM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A good submatrix is hard to find
• Automatic identification of embedded network rows in large-scale optimization models
• Extracting embedded generalized networks from linear programming problems
• A note on some computationally difficult set covering problems
• Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization Models
• A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
• Optimal set partitioning, matchings and lagrangian duality
• An Algorithm for Large Set Partitioning Problems
• On the Set-Covering Problem: II. An Algorithm for Set Partitioning
• The Set-Covering Problem: A New Implicit Enumeration Algorithm
• On the facial structure of set packing polyhedra
• The Set-Partitioning Problem: Set Covering with Equality Constraints
• On the Set-Covering Problem

This page was built for publication: A network relaxation based enumeration algorithm for set partitioning