Notice
This item was automatically migrated from a legacy system. It's data has not been checked and might not meet the quality criteria of the present system.
Record link: 
http://hdl.handle.net/20.500.12708/84852
-
Title: 
Heuristic Jump Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
-
Citation: 
Gruber, M. (2008). Heuristic Jump Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem. Entscheidungsunterstützung in der Logistik-Geographische Informationssysteme, Simulation und Optimierung, Salzburg, Austria. http://hdl.handle.net/20.500.12708/84852
-
Publication Type: 
Presentation - Conference presentation
en
Authors: 
Gruber, Martin 
-
Organisational Unit: 
E192-01 - Forschungsbereich Algorithms and Complexity 
-
Date (published): 
2008
-
Event name: 
Entscheidungsunterstützung in der Logistik-Geographische Informationssysteme, Simulation und Optimierung 
-
Event date: 
18-Apr-2008 - 19-Apr-2008
-
Event place: 
Salzburg, Austria
-
Science Branch: 
Mathematik, Informatik
-
Appears in Collections:
Presentation

Show full item record

Page view(s)

127
checked on Nov 23, 2023

Google ScholarTM

Check