Uniqueness in quadratic and hyperbolic \(0-1\) programming problems

DOI10.1016/j.orl.2013.08.013zbMath1287.90045arXiv1312.0903OpenAlexW2051856231MaRDI QIDQ2450746

Bettina Klinz, Gerhard J. Woeginger, Vladimir G. Deǐneko

Publication date: 15 May 2014

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.0903

zbMATH Keywords

computational complexityquadratic programminguniquenesshyperbolic programming

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Combinatorial optimization (90C27)

Related Items (2)

Fractional 0-1 programming: applications and algorithms ⋮ On maximum ratio clique relaxations

Cites Work

• Unnamed Item
• Unnamed Item
• Pseudo-Boolean optimization
• On search over rationals
• Complexity of uniqueness and local search in quadratic 0-1 programming
• Rational search
• On complexity of unconstrained hyperbolic 0--1 programming problems
• Maximizing the Product of Two Linear Functions In 0-1 Variables
• On the complexity of unique solutions
• Methods of Nonlinear 0-1 Programming

This page was built for publication: Uniqueness in quadratic and hyperbolic \(0-1\) programming problems