A potential reduction approach to the frequency assignment problem

DOI10.1016/S0166-218X(96)00139-4zbMath0893.90132OpenAlexW2063211800MaRDI QIDQ1377670

J. Ning

Publication date: 26 January 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

approximation algorithmfrequency assignmentpreprocessinginterior point potential reduction approachnon-convex quadratic model

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items

A linear-time transformation of linear inequalities into conjunctive normal form, Comparison of column generation models for channel assignment in cellular networks, Models and solution techniques for frequency assignment problems, Constraint Propagation with Tabu List for Min-Span Frequency Assignment Problem, Solving satisfiability problems using elliptic approximations -- effective branching rules, Erratum to ``Comparison of column generation models for channel assignment in cellular networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational experience with an interior point algorithm on the satisfiability problem
• A new polynomial-time algorithm for linear programming
• An interior point algorithm to solve computationally difficult set covering problems
• On affine scaling algorithms for nonconvex quadratic programming
• Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
• The maximum clique problem
• Potential reduction algorithms for structured combinatorial optimization problems
• A semidefinite framework for trust region subproblems with applications to large scale minimization
• Newton’s Method with a Model Trust Region Modification
• A nonlinear approach to a class of combinatorial optimization problems