Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems

DOI10.1002/nav.20343zbMath1158.90424OpenAlexW2129605903MaRDI QIDQ3621930

George G. Polak, Amy Mainville Cohn, Michael J. Magazine

Publication date: 22 April 2009

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/62058

zbMATH Keywords

branch-and-boundbranch-and-priceset partitioningdelayed column generation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Modelling transfer line design problem via a set partitioning problem

Cites Work

• Production planning problems in printed circuit board assembly
• An exact algorithm for IP column generation
• Workload planning in small lot printed circuit board assembly
• An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
• A tabu search heuristic and adaptive memory procedure for political districting
• Decomposition Principle for Linear Programs
• Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants
• Set Partitioning: A survey
• A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
• School redistricting: embedding GIS tools with integer programming
• Solving a home-care districting problem in an urban setting
• Design of balanced MBA student teams
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Constraint programming based column generation for crew assignment