000012739 001__ 12739
000012739 005__ 20130225122034.0
000012739 0248_ $$aoai:doc.rero.ch:20091013160816-GI$$ppreprint$$prero_explore$$zcdu34$$zthesis_urn$$zreport$$zthesis$$zbook$$zcdu51$$zjournal$$zcdu16$$zhegge$$zcdu1$$zdissertation$$zpostprint
000012739 041__ $$aeng
000012739 080__ $$a51
000012739 100__ $$aVarone, Sacha$$uHaute école de gestion de Genève
000012739 245__ $$9eng$$aA constructive algorithm for realizing a distance matrix
000012739 269__ $$c2005
000012739 300__ $$a13
000012739 520__ $$9eng$$aThe natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric by a graph, such that the total length of the graph is minimized. For that purpose, we give a constructive algorithm based on a technique of reduction, fusion and deletion. We then show some results on a set of various distance matrices whose optimal realization is known.
000012739 695__ $$9eng$$ametrics ; reduction ; heuristics
000012739 773__ $$tEuropean Journal of Operational Research
000012739 8564_ $$fVarone_constructive.pdf$$qapplication/pdf$$s154697$$uhttp://doc.rero.ch/record/12739/files/Varone_constructive.pdf$$yorder:1$$zTexte intégral
000012739 918__ $$cCentre de recherche appliquée en gestion (CRAG)
000012739 919__ $$aHaute école de gestion de Genève$$bGenève$$ddoc.support@rero.ch
000012739 980__ $$aPREPRINT$$bHEGGE
000012739 990__ $$a20091013160816-GI