This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Searching for optimal integer solutions to set partitioning problems using column generation

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Bredström, David () (Dept. of Mathematics, Linköping University)
Jörnsten, Kurt () (Dept. of Finance and Management Science, Norwegian School of Economics and Business Administration)
Rönnqvist, Mikael () (Dept. of Finance and Management Science, Norwegian School of Economics and Business Administration)
Abstract

We describe a new approach to produce integer feasible columns to a set partitioning problem directly in solving the linear programming (LP) relaxation using column generation. Traditionally, column generation is aimed to solve the LP relaxation as quick as possible without any concern of the integer properties of the columns formed. In our approach we aim to generate the columns forming the optimal integer solution while simultaneously solving the LP relaxation. By this we can remove column generation in the branch and bound search. The basis is a subgradient technique applied to a Lagrangian dual formulation of the set partitioning problem extended with an additional surrogate constraint. This extra constraint is not relaxed and is used to better control the subgradient evaluations. The column generation is then directed, via the multipliers, to construct columns that form feasible integer solutions. Computational experiments show that we can generate the optimal integer columns in a large set of well known test problems as compared to both standard and stabilized column generation and simultaneously keep the number of columns smaller than standard column generation.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://www.nhh.no/for/dp/2007/2007.pdf
Our checks indicate that this address may not be valid because: 404 Not Found. If this is indeed the case, please notify (Stein Fossen)
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Department of Finance and Management Science, Norwegian School of Economics and Business Administration in its series Discussion Papers with number 2007/20.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 15 pages
Date of creation: 09 Aug 2007
Date of revision:
Handle: RePEc:hhs:nhhfms:2007_020

Contact details of provider:
Postal: NHH, Department of Finance and Management Science, Helleveien 30, N-5045 Bergen, Norway
Phone: +47 55 95 92 93
Fax: +47 55 95 96 50
Email:
Web page: http://www.nhh.no/for/
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Stein Fossen).

Related research
Keywords: Linear Programming; Branch and Bound tree; Lagrangian dual formulation;

Find related papers by JEL classification:
C61 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Optimization Techniques; Programming Models; Dynamic Analysis

This paper has been announced in the following NEP Reports:

Statistics
Access and download statistics

Did you know? RePEc data is maintained by each archive holder on its own website. Nothing is held centrally.

This page was last updated on 2009-11-26.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.