authors 
Campello, Ruy Eduardo and Maculan, Nelson 
year 
1983 
title 
A Lower Bound to the Set Partitioning Problem with Side Constraints 
source 
24 p. : ill. Pittsburgh: Design Research Center, CMU, December, 1983 DRC702083. includes bibliography. 
summary 
A Lagrangean relaxation approach is proposed to provide a lower bound on the optimal solution of the set partitioning problem with side constraints, which is a general methodology to solve a combinatorial optimization problem. This Lagrangean relaxation approach is accomplished by a subgradient optimization procedure which solves at each iteration a special 01 knapsack problem. The approach seems to be promising since it produces feasible integer solutions to the side constraints that can hopefully be the optimal solution to most of the instances of the set partitioning problem with side constraints 
keywords 
mathematics, operations research, relaxation, algorithms, combinatorics, optimization, constraints 
series 
CADline 
references 
Contenttype: text/plain

last changed 
2003/06/02 11:58 
