The generalized minimum spanning tree problem

By P. Pop. 2002

125 citations recorded by the source corpus.

No part of this work may be reproduced by print, photocopy or any other means without the permission in writing from the publisher. To the memory of my mother Pop Ana Preface I want to thank to all the people who helped me, directly and indirectly with the realization of this thesis. First of all I want to thank my supervisors prof. U. Faigle and prof. G. Woeg-inger; to prof. U. Faigle also for offering me the opportunity to become a PhD student in the Operations Research group. Besides prof. Faigle and prof. Woeginger there were two persons without whom this work could not be carried out in the manner it has been done: Walter Kern and Georg Still. Their advice and support during the project were very valuable for me and I enjoyed very much working with them. A special word of thanks goes to my daily supervisor Still. The door of his office was always open for me and he has always found time to answer my questions and to hear my problems. I am very happy that I met prof. G. Woeginger. I am grateful to him for the useful discussions we had and his comments regarding my research. I want to express my gratitude to prof. C. Hoede, prof. R. Dekker, prof. A. van Harten and prof. M. Labbé for participating in the promotion committee and for their interest in my research. A word of thanks goes to my colleagues from the Department of Discrete Mathematics, Operations Research and Stochastic and in particular to my former office-mates: Cindy Kuipers and Daniële Paulusma who offered me a pleasant working environment. During the time spent in Twente I made many good friends and I am sure that without them my life in the Netherlands would not be so comfortable. At last but not at least I want to thank to my family. vii In particular I am most grateful to my wife, my parents and my brother. I would not have been where I am now without their unconditioned love and support.

Subfields: Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/b1c1d1f911568dccc7898aa6ecad52b2da0da59a

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Industrial and Manufacturing Engineering

Citations in the corpus

Minimum Loss Network Reconfiguration Using Mixed-Integer Convex Programming (2012, background): “A similar set of constraints was previously discussed in the context of generalized minimum spanning tree problems [26].”
A survey on benders decomposition applied to fixed-charge network design problems (2005, background): “Examples are the design of a local access network with one or two technologies (Randazzo and Luna, 2001; Randazzo, Luna and Mahey, 2001), the project of a terminal layout (Gavish, 1983; Gouveia, 1995), and the interconnection of existing networks (Myung, Lee and Tcha, 1995).”
Resilient Disaster Recovery Logistics of Distribution Systems: Co-Optimize Service Restoration With Repair Crew and Mobile Power Source Dispatch (2018, unknown): “In this work, the extensively used single-commodity flow model is adopted to formulate (23) [49].”
A Flexible Mixed-Integer Linear Programming Approach to the AC Optimal Power Flow in Distribution Systems (2014, methodology): “Reference [19] introduced a formulation of radiality constraints based on ensuring that the distribution network consists of a spanning tree that spans from the root node, and employing constraints similar to those proposed in [31] for generalized minimum spanning tree problems.”
Image Geo-Localization Based on MultipleNearest Neighbor Feature Matching UsingGeneralized Graphs (2014, unknown): “The linkage-based dual of GMCP is GMST [33].”