scholarly journals Searching for Optimal Integer Solutions to Set Partitioning Problems Using Column Generation

2007 ◽  
Author(s):  
David Bredstrom ◽  
Kurt Jornsten ◽  
Mikael Ronnqvist
Keyword(s):  
Column Generation ◽  
Set Partitioning ◽  
Partitioning Problems ◽  
Integer Solutions

scholarly journals Integral column generation for the set partitioning problem

2019 ◽  
Vol 8 (5) ◽  
pp. 713-744 ◽  
Author(s):  
Adil Tahir ◽  
Guy Desaulniers ◽  
Issmail El Hallaoui
Keyword(s):  
Column Generation ◽  
Set Partitioning ◽  
Set Partitioning Problem ◽  
Partitioning Problem

scholarly journals A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem

2020 ◽  
Vol 32 (3) ◽  
pp. 582-599 ◽  
Author(s):  
Samuel Deleplanque ◽  
Martine Labbé ◽  
Diego Ponce ◽  
Justo Puerto
Keyword(s):  
Column Generation ◽  
Set Partitioning ◽  
Computational Time ◽  
Median Problem ◽  
Ordered Median ◽  
Set Partitioning Problem ◽  
Continuous Relaxation ◽  
Partitioning Problem

The discrete ordered median problem (DOMP) is formulated as a set-partitioning problem using an exponential number of variables. Each variable corresponds to a set of demand points allocated to the same facility with the information of the sorting position of their corresponding costs. We develop a column generation approach to solve the continuous relaxation of this model. Then we apply a branch-price-and-cut algorithm to solve small- to large-sized instances of DOMP in competitive computational time.

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

2009 ◽  
Vol 56 (3) ◽  
pp. 215-225 ◽  
Author(s):  
Amy Cohn ◽  
Michael Magazine ◽  
George Polak
Keyword(s):  
Set Partitioning ◽  
Partitioning Problems
Sign in / Sign up

Export Citation Format

Share Document