An Algorithm for Large Set Partitioning Problems

DOI10.1287/mnsc.20.5.774zbMath0304.90077OpenAlexW2075807410MaRDI QIDQ4060729

Roy E. Marsten

Publication date: 1974

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: http://www.kellogg.northwestern.edu/research/math/papers/8.pdf

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (22)

A clustering heuristic to detect staircase structures in large scale linear programming models ⋮ The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems ⋮ Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem ⋮ A surrogate heuristic for set covering problems ⋮ Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms ⋮ A monotonic, dual-based bounding procedure for integer programs ⋮ A dual strategy for solving the linear programming relaxation of a driver scheduling system ⋮ Aggregation of constraints in integer programming ⋮ Tighter representations for set partitioning problems ⋮ A network relaxation based enumeration algorithm for set partitioning ⋮ Use of hidden network structure in the set partitioning problem ⋮ Implicit enumeration algorithms for the set-partitioning problem ⋮ Set partitioning mit linearen Randbedingungen ⋮ An integer programming approach to generating airline crew pairings ⋮ Modeling and algorithmic development of a staff scheduling problem ⋮ Using dual network bounds in algorithms for solving generalized set packing/partitioning problems ⋮ A multi-product loading problem: A model and solution method ⋮ An algorithm for set covering problem ⋮ Efficient automated pallet loading ⋮ A concurrent processing framework for the set partitioning problem ⋮ OPTIMAL SET-PARTITIONING BASED ON GROUP QUALITY LIKELIHOOD USING PARTITION-GROWING ALGORITHM ⋮ Optimal set partitioning, matchings and lagrangian duality

This page was built for publication: An Algorithm for Large Set Partitioning Problems