a special issue of Optimization Letters
Optimization Letters ( List of contributions -
**Generalized cut and metric polytopes of graphs and simplicial complexes**, by*Michel Deza*,*Mathieu Dutour Sikiric*. Springerlink. -
**Hitting time quasi-metric and its forest representation**, by*Pavel Chebotarev*,*Elena Deza*. Springerlink. -
**Distance between vertices of lattice polytopes**, by*Anna Deza*,*Antoine Deza*,*Zhongyan Guan*,*Lionel Pournin*. Springerlink. -
**Correction to: Distance between vertices of lattice polytopes**, by*Anna Deza*,*Antoine Deza*,*Zhongyan Guan*,*Lionel Pournin*. Springerlink. -
**Chirality in metric spaces**, by*Michel Petitjean*. Springerlink. -
**Perfect elimination orderings for symmetric matrices**, by*Monique Laurent*,*Shin-ichi Tanigawa*. Springerlink. -
**An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes**, by*Alain Hertz*. Science Direct link. -
**Modelling and solving the perfect edge domination problem**, by*Vinicius L. do Forte*,*Min Chih Lin*,*Abilio Lucena*,*Nelson Maculan*,*Veronica A. Moyano*,*Jayme L. Szwarcfiter*. Springerlink. -
**Representation of the Minkowski metric as a fuzzy set**, by*Juan Carlos Figueroa-García*,*Miguel Alberto Melgarejo-Rey*,*Germán Hernández-Pérez*. Springerlink. -
**On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs**, by*Claudia D'Ambrosio*,*Marcia Fampa*,*Jon Lee*,*Stefan Vigerske*. Springerlink. -
**On an SDP relaxation for kissing number**, by*Jon Lee*,*Leo Liberti*. Springerlink. -
**A least-squares approach for discretizable distance geometry problems with inexact distances**, by*Douglas S. Gonçalves*. Springerlink. -
**An integer programming approach for the search of discretization orders in distance geometry problems**, by*Jérémy Omer*,*Douglas S. Gonçalves*. Springerlink. -
**Nonlinear mapping and distance geometry**, by*Alain Franc*,*Pierre Blanchard*,*Olivier Coulaud*. Springerlink. -
**The**, by*K*-discretization and*K*-incident graphs for discretizable Distance Geometry*Germano Abud*,*Jorge Alencar*,*Carlile Lavor*,*Leo Liberti*,*Antonio Mucherino*. Springerlink. -
**A constrained interval approach to the generalized distance geometry problem**, by*Luiz Leduino de Salles Neto*,*Carlile Lavor*,*Weldon Lodwick*. Springerlink. -
**An application-based characterization of dynamical distance geometry problems**, by*Antonio Mucherino*,*Jeremy Omer*,*Ludovic Hoyet*,*Paolo Robuffo Giordano*,*Franck Multon*. Springerlink.
By mistake, one contribution, which was originally planned for this special issue, was assigned to a regular issue of Optimization Letters: -
**An exact result for (0,±1)-vectors**, by*Peter Frankl*, Optimization Letters 12(5) 1011-1017, 2018.
From left to right: Carlile Lavor, Michel Deza, and Antonio Mucherino. |