Please use this identifier to cite or link to this item:
Type: Outro documento
Title: A new quadratic relaxation for binary variables applied to the distance geometry problem
Author: Bartmeyer, Petra M.
Lyra, Christiano
Abstract: Problems in structural optimization typically involve decisions modeled as binary variables that lead to difficult combinatorial optimization problems. The literature presents different techniques to relax the binary variables in order to avoid the high computational costs required by the solution of combinatorial problems. This note develops a novel relaxation strategy to map a problem with binary variables into an equivalent problem with continuous variables. A set of theoretical results prove the equivalence of the proposed approach and the original binary optimization problem. The strategy is applied to the unassigned distance geometry problem, relying on the design of a new formulation for the problem. Computational studies illustrate the benefits of the proposed relaxation
Subject: Otimização combinatória
Country: Alemanha
Editor: Springer
Rights: Fechado
Identifier DOI: 10.1007/s00158-020-02567-7
Date Issue: 2020
Appears in Collections:FEEC - Artigos e Outros Documentos

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.