IDEAS home Printed from https://ideas.repec.org/p/hhs/nhhfms/2007_020.html
   My bibliography  Save this paper

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

Author

Listed:
  • 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.

Suggested Citation

  • Bredström, David & Jörnsten, Kurt & Rönnqvist, Mikael, 2007. "Searching for optimal integer solutions to set partitioning problems using column generation," Discussion Papers 2007/20, Norwegian School of Economics, Department of Business and Management Science.
  • Handle: RePEc:hhs:nhhfms:2007_020
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/11250/227271
    Download Restriction: no

    References listed on IDEAS

    as
    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)

    More about this item

    Keywords

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

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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). General contact details of provider: http://edirc.repec.org/data/dfnhhno.html .

    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 CitEc recognized a reference but did not link an item in RePEc 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.