A potential reduction approach to the frequency assignment problem
type: Item
instance of: scholarly article
title: A potential reduction approach to the frequency assignment problem
zbMATH Open document ID: 0893.90132
DOI: 10.1016/S0166-218X(96)00139-4
author: J. Ning
published in: Discrete Applied Mathematics
publication date: 1998-01-26T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1109947
zbMATH Keywords: frequency assignment
zbMATH Keywords: approximation algorithm
zbMATH Keywords: interior point potential reduction approach
zbMATH Keywords: non-convex quadratic model
zbMATH Keywords: preprocessing
MaRDI profile type: Publication
cites work: Q5583564
cites work: Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
cites work: Computational experience with an interior point algorithm on the satisfiability problem
cites work: Q4400639
cites work: A new polynomial-time algorithm for linear programming
cites work: Q5202849
cites work: An interior point algorithm to solve computationally difficult set covering problems
cites work: Q3050157
cites work: The maximum clique problem
cites work: A semidefinite framework for trust region subproblems with applications to large scale minimization
cites work: Newton’s Method with a Model Trust Region Modification
cites work: A nonlinear approach to a class of combinatorial optimization problems
cites work: Potential reduction algorithms for structured combinatorial optimization problems
cites work: On affine scaling algorithms for nonconvex quadratic programming
OpenAlex ID: W2063211800
description: scientific article; zbMATH DE number 1109947