Quadratic programming and combinatorial minimum weight product problems

DOI10.1007/S10107-006-0047-7MaRDI QIDQ985315zbMATH OpenOpenAlexFDO

Authors Walter Kern, Gerhard J. Woeginger

Publication date 21 July 2010

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-006-0047-7

zbMATH Keywords

quadratic programmingshortest pathapproximation scheme

Mathematics Subject Classification ID

Quadratic programming (90C20)

Recommendations

• Quadratic Programming and Combinatorial Minimum Weight Product Problems
• Quadratic programming problems and related linear complementarity problems
• scientific article; zbMATH DE number 757652
• Combinatorial algorithm for quadratic programs with Laplacian structure
• scientific article; zbMATH DE number 1173721
• Approximating the minimum quadratic assignment problems
• scientific article; zbMATH DE number 3970529
• scientific article; zbMATH DE number 1568992
• Preface: Quadratic combinatorial optimization problems
• scientific article; zbMATH DE number 3936928

Cites work

• scientific article; zbMATH DE number 429516 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3677572 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Approximation algorithms for indefinite quadratic programming
• Combinatorial Optimization with Rational Objective Functions
• Generalized concavity
• Network flows. Theory, algorithms, and applications.
• Polynomial algorithms for a class of minimum rank-two cost path problems
• Quadratic programming with one negative eigenvalue is NP-hard

Cited in

(15)

• The Rank-One Quadratic Assignment Problem
• A FPTAS for a class of linear multiplicative problems
• A characterization of linearizable instances of the quadratic minimum spanning tree problem
• Differential approximation schemes for half-product related functions and their scheduling applications
• Fast heuristics and approximation algorithms
• Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
• Analysis of FPTASes for the multi-objective shortest path problem
• Linear decomposition approach for a class of nonconvex programming problems
• Approximation of linear fractional-multiplicative problems
• Quadratic Programming and Combinatorial Minimum Weight Product Problems
• A normal fan projection algorithm for low-rank optimization
• An FPTAS for optimizing a class of low-rank functions over a polytope
• A class of exponential neighbourhoods for the quadratic travelling salesman problem
• An FPTAS for minimizing the product of two non-negative linear cost functions
• Approximation algorithm for a class of global optimization 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 Q985315)