A concurrent processing framework for the set partitioning problem

DOI10.1016/S0305-0548(01)00037-5zbMath0994.90112MaRDI QIDQ1603333

Anito Joseph

Publication date: 11 July 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(01)00037-5

Mathematics Subject Classification ID

90C27: Combinatorial optimization

Related Items

Searching for optimal integer solutions to set partitioning problems using column generation, A dual ascent procedure for the set partitioning problem, OPTIMAL SET-PARTITIONING BASED ON GROUP QUALITY LIKELIHOOD USING PARTITION-GROWING ALGORITHM

Uses Software

• OSL

Cites Work

• Unnamed Item
• On the integer properties of scheduling set partitioning models
• Reformulation of the set partitioning problem as a pure network with special order set constraints
• The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
• Graph theoretic relaxations of set covering and set partitioning problems
• Tighter representations for set partitioning problems
• A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
• Constraint handling in genetic algorithms: the set partitioning problem
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• A Column Generation Approach to the Urban Transit Crew Scheduling Problem
• A Multiplier Adjustment Approach for the Set Partitioning Problem
• An Algorithm for Large Set Partitioning Problems
• Technical Note—A Note on Zero-One Programming
• Set Partitioning: A survey
• Covering, Packing and Knapsack Problems
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• The Column Generation Principle And The Airline Crew Scheduling Problem
• On the facial structure of set packing polyhedra
• The Set-Partitioning Problem: Set Covering with Equality Constraints