Advanced Search
MyIDEAS: Login to save this paper or follow this series

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

Contents:

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

If you experience problems downloading a file, check if you have the proper application to view it first. 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)
Download Restriction: no

Bibliographic Info

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

as in new window
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 Business 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/en/research-faculty/department-of-business-and-management-science.aspx
More information through EDIRC

Related research

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

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Karla L. Hoffman & Manfred Padberg, 1993. "Solving Airline Crew Scheduling Problems by Branch-and-Cut," Management Science, INFORMS, vol. 39(6), pages 657-682, June.
Full references (including those not matched with items on IDEAS)

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:hhs:nhhfms:2007_020. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Stein Fossen).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.