A Multiplier Adjustment Approach for the Set Partitioning Problem

DOI10.1287/OPRE.40.1.S40MaRDI QIDQ3990562zbMATH OpenOpenAlexFDO

Authors Thomas Justin Chan, Candace Arai Yano

Publication date 28 June 1992

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.40.1.s40

zbMATH Keywords

branch-and-boundcomplementary branching strategymultiplier-adjustment-based bounding procedureset partitioning

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Linear programming (90C05) Boolean programming (90C09)

Recommendations

• A Set Partitioning Approach to the Crew Scheduling Problem
• A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
• scientific article; zbMATH DE number 1054679
• Solving large scale crew scheduling problems
• A dual ascent procedure for the set partitioning problem

Cited in

(15)

• Penalty computations for the set partitioning problem
• Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
• A dynamic programming based algorithm for the crew scheduling problem.
• A concurrent processing framework for the set partitioning problem
• The matching relaxation for a class of generalized set partitioning problems
• Tighter representations for set partitioning problems
• A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
• Optimal set-partitioning based on group quality likelihood using partition-growing algorithm
• A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program
• A recurrence relation for estimating the size of set partitioning problem that can be completely aggregated on a given computer, using Kendall and Zionts aggregation scheme
• Use of hidden network structure in the set partitioning problem
• Progress in Artificial Intelligence
• scientific article; zbMATH DE number 5050579 (Why is no real title available?)
• A dual ascent procedure for the set partitioning problem
• Multi-phase dynamic constraint aggregation for set partitioning type problems

This page was built for publication: A Multiplier Adjustment Approach for the Set Partitioning Problem

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