Approximation algorithms for discrete polynomial optimization
type: Item
instance of: scholarly article
title: Approximation algorithms for discrete polynomial optimization
zbMATH Open document ID: 1281.90026
author: Simai He
author: Zhening Li
author: Shuzhong Zhang
published in: Journal of the Operations Research Society of China
publication date: 2013-11-27T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 15A69
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6233802
zbMATH Keywords: polynomial optimization problem
zbMATH Keywords: binary integer programming
zbMATH Keywords: mixed integer programming
zbMATH Keywords: approximation algorithm
zbMATH Keywords: approximation ratio
MaRDI profile type: Publication
full work available at URL: s40305-013-0003-1
OpenAlex ID: W2163718799
cites work: Solving a system of linear Diophantine equations with lower and upper bounds on the variables.
cites work: Approximating the Cut-Norm via Grothendieck's Inequality
cites work: Random sampling and approximation of MAX-CSP problems
cites work: Notes—On a Selection Problem
cites work: Faster algorithms for Frobenius numbers
cites work: Q4247459
cites work: Neural networks, error-correcting codes, and polynomials over the binary n-cube
cites work: Maximum block improvement and polynomial optimization
cites work: Q3840366
cites work: Automata, Languages and Programming
cites work: Recognizing More Unsatisfiable Random k-SAT Instances Efficiently
cites work: Quick approximation to matrices and applications
cites work: Q4198056
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Q5538300
cites work: Methods of Nonlinear 0-1 Programming
cites work: Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
cites work: ``Neural'' computation of decisions in optimization problems
cites work: Approximation algorithms for indefinite complex quadratic maximization problems
cites work: Spectral methods for matrices and tensors
cites work: On the best rank-1 approximation of higher-order supersymmetric tensors
cites work: Semidefinite relaxation and nonconvex quadratic optimization
cites work: Q4331818
cites work: A Selection Problem of Shared Fixed Costs and Network Flows
cites work: Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
DOI: 10.1007/S40305-013-0003-1
description: scientific article; zbMATH DE number 6233802