Abstract
We present a fully polynomial time approximation scheme (FPTAS) for minimizing an objective (a T x+γ)(b T x+δ) under linear constraints Ax ≤d. Examples of such problems are combinatorial minimum weight product problems such as, e.g., the following: Given a graph G=(V,E) and two edge weights \({\bf a, b}: E \to {\mathbb R}_{+}\) find an s–t path P that minimizes a(P)b(P), the product of its edge weights relative to a and b.
AMS-Class: 90C20, 90C26, 90C27.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs (1993)
Avriel, M., Dievert, W.E., Schaible, S., Zhang, I.: Generalized Convexity. Plenum Press, New York (1988)
Faigle, U., Kern, W., Still, G.: Algorithmic Principles of Mathematical Programming. Kluwer, Dordrecht (2001)
Garey, M., Johnson, D.: Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Gusfield, D.: Sensitivity analysis for combinatorial optimization, Memorandum UCB/ERL M80/22, Electronics Research Laboratory, Berkeley (1980)
Kozlov, M., Tarasov, S., Hacijan, L.: Polynomial Solvability of Convex Quadratic Programming. Soviet Math. Doklady 20, 1108–1111 (1979)
Kuno, T.: Polynomial algorithms for a class of minimum rank-two cost path problems. Journal of Global Optimization 15, 405–417 (1999)
Megiddo, N.: Combinatorial Optimization with rational objective functions. Mathematics of OR 4(4), 414–424 (1979)
Pardalos, P., Vavasis, S.: Quadratic Programming with One Negative Eigenvalue is NP-hard. Journal of Global Optimization 1, 15–22 (1991)
Schrijver, A.: Theory of linear and Integer Programming. Wiley, Chichester (1986)
Vavasis, S.: Approximation algorithms for indefinite quadratic programming. Math. Prog. 57, 279–311 (1992)
Vavasis, S.: Nonlinear optimization: complexity issues. Oxford University Press, Oxford (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kern, W., Woeginger, G. (2006). Quadratic Programming and Combinatorial Minimum Weight Product Problems. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds) Algorithms and Complexity. CIAC 2006. Lecture Notes in Computer Science, vol 3998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758471_7
Download citation
DOI: https://doi.org/10.1007/11758471_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34375-2
Online ISBN: 978-3-540-34378-3
eBook Packages: Computer ScienceComputer Science (R0)