Skip to main content
SpringerLink
Log in

A Practical Algorithm for Computing a Subadditive Dual Function for Set Partitioning

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

Recently, a new algorithm for computing an optimal subadditive dual function to an integer program has been proposed. In this paper we show how to apply the algorithm to the set partitioning problem. We give several enhancements to the algorithm and we report computational experiments. The results show that it is tractable to obtain an optimal subadditive function for small and medium size problems. To the best of our knowledge this is the first work that reports computational experiments on computing an optimal subadditive dual function.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. 1._ E. Balas and M. Carrera, “A dynamic subgradient-based branch-and-bound procedure for set covering,” Operations Research, vol. 44, pp. 875–890, 1996.

    Google Scholar 

  2. R. Borndorfer, “Aspects of set packing, partitioning, and covering,” Ph.D. Dissertation, Technical University of Berlin, 1998.

  3. C. Burdet and E. Johnson, “A subadditive approach to solve integer programs,” Annals of Discrete Mathematics, vol. 1, pp. 117–144, 1977.

    Google Scholar 

  4. CPLEX Optimization, Using the CPLEX Callable Library, 6.5 edition, ILOG Inc., 1999.

  5. M. Eso, “Parallel branch and cut for set partitioning,” Ph.D. Dissertation, Cornell University, 1999.

  6. R. Gomory, “Some polyhedra related to combinatorial problems,” Linear Algebra and Applications, vol. 2, pp. 451–558, 1969.

    Google Scholar 

  7. K. Hoffman and M. Padberg, “Solving airline crew scheduling problems by branch-and-cut,” Management Science, vol. 39, pp. 657–682, 1993.

    Google Scholar 

  8. E. Johnson, “Cyclic groups, cutting planes and shortest path,” in Mathematical Programming, T. Hu and S. Robinson (Eds.), Academic Press, 1973, pp. 185–211.

  9. D. Klabjan, “A new subadditive approach to integer programming,” Technical report, University of Illinois at Urbana-Champaign, 2003, Available from http://netfiles.uiuc.edu/klabjan/www.

  10. D. Llewellyn and J. Ryan, “A primal dual integer programming algorithm,” Discrete Applied Mathematics, vol. 45, pp. 261–275, 1993.

    Google Scholar 

  11. M. Savelsbergh, “Preprocessing and probing for mixed integer programming problems,” ORSA Journal on Computing, vol. 6, pp. 445–454, 1994.

    Google Scholar 

  12. L. Wolsey, “Integer programming duality: Price functions and sensitivity analysis,” Mathematical Programming, vol. 20, pp. 173–195, 1981.

    Google Scholar 

  13. L. Wolsey, Integer Programming, John Wiley & Sons, 1998.

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical and Industrial Engineering, University of Illinois at Urbana-Champaign, Urbana, IL, USA

    Diego Klabjan

Authors
  1. Diego Klabjan
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Klabjan, D. A Practical Algorithm for Computing a Subadditive Dual Function for Set Partitioning. Computational Optimization and Applications 29, 347–368 (2004). https://doi.org/10.1023/B:COAP.0000044186.99585.51

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:COAP.0000044186.99585.51

Search

Navigation