A nonlinear approach to a class of combinatorial optimization problems

DOI10.1111/1467-9574.00076zbMath0948.90127OpenAlexW2086128329MaRDI QIDQ4259026

No author found.

Publication date: 27 November 2000

Published in: Statistica Neerlandica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/1467-9574.00076

zbMATH Keywords

combinatorial optimizationnonlinear optimizationinterior point methodsfrequency assignmentgradient descent

Mathematics Subject Classification ID

Nonlinear programming (90C30) Interior-point methods (90C51) Combinatorial optimization (90C27)

Related Items (4)

A linear-time transformation of linear inequalities into conjunctive normal form ⋮ Potential reduction algorithms for structured combinatorial optimization problems ⋮ A potential reduction approach to the frequency assignment problem ⋮ Solving satisfiability problems using elliptic approximations -- effective branching rules

Uses Software

• LIPSOL

This page was built for publication: A nonlinear approach to a class of combinatorial optimization problems