The minimum distance superset problem: formulations and algorithms
From MaRDI portal
Publication:1756748
Recommendations
- The simplified partial digest problem: approximation and a graph-theoretic model
- scientific article; zbMATH DE number 2209734
- Partial digest is hard to solve for erroneous input data
- LATIN 2004: Theoretical Informatics
- An integer programming approach for the search of discretization orders in distance geometry problems
Cites work
- A partial digest approach to restriction site mapping
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- scientific article; zbMATH DE number 2209734 (Why is no real title available?)
- Nonparametric statistical methods
- Partial digest is hard to solve for erroneous input data
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Some necessary clarifications about the chords' problem and the partial digest problem
- The chords' problem
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
Cited in
(2)
This page was built for publication: The minimum distance superset problem: formulations and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756748)
