Optimization Letters

, Volume 6, Issue 8, pp 1687–1705 | Cite as

Worst-case analysis of maximal dual feasible functions

  • Jürgen Rietz
  • Cláudio Alves
  • J. M. Valério de Carvalho
Original Paper
First Online:
Received:
Accepted:

Abstract

Dual feasible functions have been used to compute fast lower bounds and valid inequalities for integer linear problems. In this paper, we analyze the worst-case performance of the lower bounds provided by some of the best functions proposed in the literature. We describe some worst-case examples for these functions, and we report on new results concerning the best parameter choice for one of these functions.

Keywords

Dual feasible functions Maximal functions Worst-case performance 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Burdett C.A., Johnson E.L.: A subadditive approach to solve linear integer programs. Ann. Discrete Math. 1, 117–144 (1977)CrossRefGoogle Scholar
  2. 2.
    Carlier J., Clautiaux F., Moukrim A.: New reduction procedures and lower bounds for the two-dimensional bin-packing problem with fixed orientation. Comput. Oper. Res. 34, 2223–2250 (2007)MATHCrossRefGoogle Scholar
  3. 3.
    Clautiaux F., Alves C., Valério de Carvalho J.: A survey of dual-feasible and superadditive functions. Ann. Oper. Res. 179, 317–342 (2010)MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Dash S., Günlük O.: Valid inequalities based on simple mixed-integer sets. Math. Program. 105, 29–53 (2006)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Fekete S., Schepers J.: New classes of fast lower bounds for bin packing problems. Math. Program. 91, 11–31 (2001)MathSciNetMATHGoogle Scholar
  6. 6.
    Gilmore P., Gomory R.: A linear programming approach to the cutting stock problem (part I). Oper. Res. 9, 849–859 (1961)MathSciNetMATHCrossRefGoogle Scholar
  7. 7.
    Johnson, D.S.: Near optimal bin packing algorithms. Dissertation, Massachussetts Institute of Technology, Cambridge, Massachussetts (1973)Google Scholar
  8. 8.
    Letchford A.N., Lodi A.: Strengthening Chvával-Gomory cuts and Gomory fractional cuts. Oper. Res. Lett. 30, 74–82 (2002)MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Martello S., Toth P.: Knapsack Problems—Algorithms and Computer Implementation. Wiley, Chichester (1990)Google Scholar
  10. 10.
    Mitchell J.: Integer programming: cutting plane algorithms. In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization, pp. 1650–1657. Springer, Berlin (2009)CrossRefGoogle Scholar
  11. 11.
    Pardalos, P., Resende, M. (eds): Handbook of Applied Optimization. Oxford University Press, New York (2002)MATHGoogle Scholar
  12. 12.
    Prékopa A., Fábián C.: Cutting-stock problem. In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization, pp. 594–595. Springer, Berlin (2009)CrossRefGoogle Scholar
  13. 13.
    Rietz J., Alves C., Valério de Carvalho J.: Theoretical investigations on maximal dual feasible functions. Oper. Res. Lett. 38, 174–178 (2010)MathSciNetMATHCrossRefGoogle Scholar
  14. 14.
    Vanderbeck F.: Exact algorithm for minimizing the number of setups in the one-dimensional cutting stock problem. Oper. Res. 46(6), 915–926 (2000)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2011

Authors and Affiliations

  • Jürgen Rietz
    • 1
  • Cláudio Alves
    • 1
  • J. M. Valério de Carvalho
    • 1
  1. 1.Dept. Produção e Sistemas, Centro de Investigação Algoritmi da Universidade do Minho, Escola de EngenhariaUniversidade do MinhoBragaPortugal

Personalised recommendations