A concurrent processing framework for the set partitioning problem

DOI10.1016/S0305-0548(01)00037-5MaRDI QIDQ1603333zbMATHOpenAlexFDO

Authors A. 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

Combinatorial optimization (90C27)

Recommendations

• Partitioning mathematical programs for parallel solution
• A parallel, linear programming-based heuristic for large-scale set partitioning problems
• scientific article; zbMATH DE number 1054926
• Heuristics, cutting planes and subgradient optimization for set partitioning problems
• Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming.

Cites work

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

Cited in

(5)

• Parallel algorithms for partitioning sorted sets and related problems
• A sequential aggregation algorithm for the set partitioning problem
• A dual ascent procedure for the set partitioning problem
• Optimal set-partitioning based on group quality likelihood using partition-growing algorithm
• Searching for optimal integer solutions to set partitioning problems using column generation

Describes a project that uses

Uses Software

• OSL

This page was built for publication: A concurrent processing framework for the set partitioning problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603333)