Quadratic Programming and Combinatorial Minimum Weight Product Problems

DOI10.1007/11758471_7MaRDI QIDQ3434541zbMATH OpenOpenAlexFDO

Authors Walter Kern, Gerhard J. Woeginger

Publication date 2 May 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758471_7

zbMATH Keywords

approximation schemeQuadratic Programmingshortest path

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Quadratic programming and combinatorial minimum weight product problems
• An FPTAS for minimizing the product of two non-negative linear cost functions
• A FPTAS for a class of linear multiplicative problems
• The quadratic shortest path problem: complexity, approximability, and solution methods
• Approximation algorithms for quadratic programming

Cited in

(2)

• An FPTAS for minimizing the product of two non-negative linear cost functions
• Quadratic programming and combinatorial minimum weight product problems

This page was built for publication: Quadratic Programming and Combinatorial Minimum Weight Product Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434541)