Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

WORLD SCIENTIFIC eBooks

Polynomial Time Weak Approximation Algorithms for Quadratic Programming

Stephen A. Vavasis

Published Jul 1, 1993• 19 citations
Publisher
DOI
10.1142/9789814354363_0022

Related papers

A simple polynomial-time algorithm for convex quadratic programming

Paul Tseng, Decision Systems.

•Jan 1, 1988•7 citations

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems

Shenshen Gu, Rui Cui, Peng Jiao

Neurocomputing•Mar 9, 2016•5 citations

Approximation Algorithms for Quadratic Programming

Minyue Fu, Zhi-Quan Tom Luo, Yinyu Ye Y

Journal of Combinatorial Optimization•Mar 1, 1998•79 citations

Approximation Algorithm for A Mixed Binary Quadratically Constrained Quadratic Programming Problem

Zi Li Xu, Mingyi Hong

•Jan 1, 2015•1 citation

An approximation algorithm for indefinite mixed integer quadratic programming

Alberto Del Pia

arXiv:2211.16442•Mathematical Programming•Dec 2, 2022•6 citations

Comment on “Approximation algorithms for quadratic programming”

Tongli Zhang, Yong Xia

arXiv:2110.10449•Journal of Combinatorial Optimization•Jul 1, 2022•1 citation