Abstract
Variable fixing is an important technique when solving combinatorial optimization problems. Unique profitable variable values are detected with respect to the objective function and to the constraint structure of the problem. Relying on that specific structure, effective variable fixing algorithms (VFAs) are only suited for the problems they have been designed for. Frequently, new combinatorial optimization problems evolve as a combination of simpler structured problems. For such combinations, we show how VFAs for linear optimization problems can be coupled via Lagrangian relaxation. The method is applied on a multimedia problem incorporating a knapsack and a maximum weighted stable set problem.
This work was partly supported by the German Science Foundation (DFG) project SFB-376, by the UP-TV project, partially funded by the IST program of the Commission of the European Union as project number 1999-20751, and by the IST Programme of the EU under contract number IST-1999-14186 (ALCOM-FT).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R.K. Ahuja, T.L. Magnati, J.B. Orlin. Network Flows. Prentice Hall, 1993.
mediaTV, technical description, Axcent AG. http://www.axcent.de.
E. Balas and E. Zemel. An algorithm for large-scale zero-one knapsack problems. Operations Research, 28:119–148, 1980.
T. Fahle and M. Sellmann. Constraint Programming Based Column Generation with Knapsack Subproblems. Proc. of the CP-AI-OR’ 00, Paderborn Center for Parallel Computing, Technical Report tr-001-2000:33–44 2000.
F. Focacci, A. Lodi, M. Milano. Cutting Planes in Constraint Programming: An Hybrid Approach. Proc. of the CP-AI-OR’ 00, Paderborn Center for Parallel Computing, Technical Report tr-001-2000:45–51, 2000.
M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1991.
J.Y. Hsiao, C.Y. Tang, R.S. Chang. An efficient algorithm for finding a maximum weight 2-independent set on interval graphs. Information Processing Letters, 43(5):229–235, 1992.
ILOG. Ilog Solver. Reference manual and user manual. V5.0, ILOG, 2000.
M. Lehradt. Basisalgorithmen für ein TV Anytime System, Diploma Thesis, University of Paderborn, 2000.
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:169–175, 1977.
G.L. Nemhauser, L. A. Wolsey. Integer and Combinatorial Optimization. Wiley Interscience, 1988.
M. Sellmann and T. Fahle. Coupling Variable Fixing Algorithms for the Automatic Recording Problem. Technical Report, University of Paderborn, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sellmann, M., Fahle, T. (2001). Coupling Variable Fixing Algorithms for the Automatic Recording Problem. In: auf der Heide, F.M. (eds) Algorithms — ESA 2001. ESA 2001. Lecture Notes in Computer Science, vol 2161. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44676-1_11
Download citation
DOI: https://doi.org/10.1007/3-540-44676-1_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42493-2
Online ISBN: 978-3-540-44676-7
eBook Packages: Springer Book Archive