The minimum distance superset problem: formulations and algorithms

DOI10.1007/s10898-017-0579-9zbMath1411.90294OpenAlexW2765301148MaRDI QIDQ1756748

Rafael Martinelli, Thibaut Vidal, Marcus Poggi, Leonardo Fontoura

Publication date: 21 December 2018

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-017-0579-9

zbMATH Keywords

integer programmingcombinatorial optimizationpartial digest problemturnpike problemminimum distance superset

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (1)

Unassigned distance geometry and molecular conformation problems

Cites Work

• Unnamed Item
• Unnamed Item
• Partial digest is hard to solve for erroneous input data
• Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• A partial digest approach to restriction site mapping
• The chords' problem
• Some necessary clarifications about the chords' problem and the partial digest problem

This page was built for publication: The minimum distance superset problem: formulations and algorithms