Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Whereas CP methods are strong with respect to the detection of local infeasibilities, OR approaches have powerful optimization abilities that ground on tight global bounds on the objective. An integration of propagation ideas from CP and Lagrangian relaxation techniques from OR combines the merits of both approaches. We introduce a general way of how linear optimization constraints can strengthen their propagation abilities via Lagrangian relaxation. The method is evaluated on a set of benchmark problems stemming from a multimedia application. The experiments show the superiority of the combined method compared with a pure OR approach and an algorithm based on two independent optimization constraints.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network Flows (Prentice-Hall, Englewood Cliffs, NJ, 1993).

    Google Scholar 

  2. E. Balas and E. Zemel, An algorithm for large-scale zero–one knapsack problems, Operations Research 28 (1980) 119–148.

    Google Scholar 

  3. J. Desrosiers, Y. Dumas, M.M. Solomon and F. Soumis, Time constrained routing and scheduling, in: Network Routing, Handbooks in Operations Research and Management Science, eds. M.O. Ball, T. Magnanti, C. Monma and G. Nemhauser, Vol. 8 (North-Holland, Amsterdam, 1995) pp. 35–139.

    Google Scholar 

  4. J. Desrochers and F. Soumis, A generalized permanent labeling algorithm for the shortest path problem with time windows, INFORS 26(3) (1988) 191–211.

    Google Scholar 

  5. H. Everett, Generalized Lagrange multiplier method for solving problems of optimum allocation of resource, Operations Research 11 (1963) 399–417.

    Google Scholar 

  6. T. Fahle, U. Junker, S.E. Karisch, N. Kohl, M. Sellmann and B. Vaaben, Constraint programming based column generation for crew assignment, Journal of Heuristics 8(1) (2002) 59–81.

    Google Scholar 

  7. T. Fahle and M. Sellmann, Constraint programming based column generation with knapsack subproblems, Annals of Operations Research 115 (2002) 73–94.

    Google Scholar 

  8. F. Focacci, A. Lodi and M. Milano, Cutting planes in constraint programming: An hybrid approach, in: Proc. of CP'00, Lecture Notes in Computer Science, Vol. 1894 (Springer, Berlin, 2000) pp. 187–201.

    Google Scholar 

  9. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1991).

    Google Scholar 

  10. M. Held and R.M. Karp, The traveling-salesman problem and minimum spanning trees, Operations Research 18 (1970) 1138–1162.

    Google Scholar 

  11. M. Held and R.M. Karp, The traveling-salesman problem and minimum spanning trees: Part II, Mathematical Programming 1 (1971) 6–25.

    Google Scholar 

  12. J.Y. Hsiao, C.Y. Tang and R.S. Chang, An efficient algorithm for finding a maximum weight 2-independent set on interval graphs, Information Processing Letters 43(5) (1992) 229–235.

    Google Scholar 

  13. ILOG, Ilog Solver, Reference manual and user manual, V5.0 (ILOG, 2000).

  14. U. Junker, S.E. Karisch, N. Kohl, B. Vaaben, T. Fahle and M. Sellmann, A framework for constraint programming based column generation, in: Proc. of the CP'99, Lecture Notes in Computer Science, Vol. 1713 (Springer, Berlin, 1999) pp. 261–274.

    Google Scholar 

  15. M. Lehradt, Basisalgorithmen für ein TV Anytime System, Diploma Thesis, University of Paderborn (2000).

  16. S. Martello and P. Toth, An upper bound for the zero–one knapsack problem and a branch and bound algorithm, European Journal of Operational Research 1 (1977) 169–175.

    Google Scholar 

  17. mediaTV, Technical Description, Axcent AG, http://www.axcent.de.

  18. M. Milano, Integration of mathematical programming and constraint programming for combinatorial optimization problems, in: Proc. of CP2000, Singapore (September 2000) tutorial.

  19. G.L. Nemhauser and L.A.Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988).

    Google Scholar 

  20. M. Sellmann and T. Fahle, Coupling variable fixing algorithms for the Automatic Recording Problem, in: 9th Annual European Symposium on Algorithms (ESA 2001), Lectures Notes in Computer Science, Vol. 2161 (2001) pp. 134–145.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Paderborn, Fürstenallee 11, D-33102, Paderborn, Germany

    Meinolf Sellmann & Torsten Fahle

Authors
  1. Meinolf Sellmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Torsten Fahle
    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

Sellmann, M., Fahle, T. Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem. Annals of Operations Research 118, 17–33 (2003). https://doi.org/10.1023/A:1021845304798

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021845304798

Search

Navigation