Quadratic programming and combinatorial minimum weight product problems
type: Item
instance of: scholarly article
title: Quadratic programming and combinatorial minimum weight product problems
zbMATH Open document ID: 1203.90120
author: Walter Kern
author: Gerhard J. Woeginger
published in: Mathematical Programming. Series A. Series B
publication date: 2010-07-21T00:00:00Z
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 5758810
zbMATH Keywords: quadratic programming
zbMATH Keywords: approximation scheme
zbMATH Keywords: shortest path
MaRDI profile type: Publication
full work available at URL: s10107-006-0047-7
OpenAlex ID: W2107589604
cites work: Q3056948
cites work: Generalized concavity
cites work: Q4198056
cites work: Q3873927
cites work: Polynomial algorithms for a class of minimum rank-two cost path problems
cites work: Combinatorial Optimization with Rational Objective Functions
cites work: Quadratic programming with one negative eigenvalue is NP-hard
cites work: Q3818127
cites work: Approximation algorithms for indefinite quadratic programming
cites work: Q3137900
DOI: 10.1007/S10107-006-0047-7
Recommended article: Quadratic Programming and Combinatorial Minimum Weight Product Problems
Recommended article: Quadratic programming problems and related linear complementarity problems
Recommended article: Q4833783
Recommended article: Q2971253
Recommended article: Q4397722
Recommended article: Approximating the minimum quadratic assignment problems
Recommended article: Q3737236
Recommended article: Q4762522
Recommended article: Preface: Quadratic combinatorial optimization problems
Recommended article: Q3710293
description: scientific article; zbMATH DE number 5758810