Distances in optimization and graphs dedicated to the memory of Michel Deza

a special issue of Optimization Letters



Optimization Letters (OPTL). Optimization Letters is an international journal covering all aspects of optimization, including theory, algorithms, computational studies, and applications, and providing an outlet for rapid publication of short communications in the field.

Link to the journal.

Distances in optimization and graphs dedicated to the memory of Michel Deza is a special issue collecting short original contributions from the research community that is close to Michel Deza's research. The issue (volume 14 number 2) collects 17 papers, and is composed by 238 pages.

Link to the special issue.



List of contributions

  1. Generalized cut and metric polytopes of graphs and simplicial complexes, by Michel Deza, Mathieu Dutour Sikiric. Springerlink.

  2. Hitting time quasi-metric and its forest representation, by Pavel Chebotarev, Elena Deza. Springerlink.

  3. Distance between vertices of lattice polytopes, by Anna Deza, Antoine Deza, Zhongyan Guan, Lionel Pournin. Springerlink.

  4. Correction to: Distance between vertices of lattice polytopes, by Anna Deza, Antoine Deza, Zhongyan Guan, Lionel Pournin. Springerlink.

  5. Chirality in metric spaces, by Michel Petitjean. Springerlink.

  6. Perfect elimination orderings for symmetric matrices, by Monique Laurent, Shin-ichi Tanigawa. Springerlink.

  7. An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes, by Alain Hertz. Science Direct link.

  8. 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.

  9. 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.

  10. 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.

  11. On an SDP relaxation for kissing number, by Jon Lee, Leo Liberti. Springerlink.

  12. A least-squares approach for discretizable distance geometry problems with inexact distances, by Douglas S. Gonçalves. Springerlink.

  13. An integer programming approach for the search of discretization orders in distance geometry problems, by Jérémy Omer, Douglas S. Gonçalves. Springerlink.

  14. Nonlinear mapping and distance geometry, by Alain Franc, Pierre Blanchard, Olivier Coulaud. Springerlink.

  15. The K-discretization and K-incident graphs for discretizable Distance Geometry, by Germano Abud, Jorge Alencar, Carlile Lavor, Leo Liberti, Antonio Mucherino. Springerlink.

  16. A constrained interval approach to the generalized distance geometry problem, by Luiz Leduino de Salles Neto, Carlile Lavor, Weldon Lodwick. Springerlink.

  17. 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:

  1. An exact result for (0,±1)-vectors, by Peter Frankl, Optimization Letters 12(5) 1011-1017, 2018.


The editors with Michel Deza (Varna, Bulgaria, summer 2012).
From left to right: Carlile Lavor, Michel Deza, and Antonio Mucherino.

Back Home