EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"robust spanning tree"
Narrow search

Narrow search

Year of publication
Subject
All
Heuristik 2 Mathematische Optimierung 2 Theorie 2 robust spanning tree 2 simulated annealing 2 uncertainty 2 Heuristics 1 Mathematical programming 1 Theory 1
more ... less ...
Online availability
All
Free 2
Type of publication
All
Book / Working Paper 2
Type of publication (narrower categories)
All
Working Paper 2 Arbeitspapier 1 Graue Literatur 1 Non-commercial literature 1
Language
All
English 2
Author
All
Nikulin, Jurij V. 1 Nikulin, Yury 1
Published in...
All
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 2
Source
All
ECONIS (ZBW) 1 EconStor 1
Showing 1 - 2 of 2
Cover Image
Simulated annealing algorithm for the robust spanning tree problem
Nikulin, Yury - 2005
This paper addresses the robust spanning tree problem with interval data, i.e. the case of classical minimum spanning … spanning tree problem. … experiments. To the best of our knowledge, this is the first attempt to develop a metaheuristic approach for solving the robust …
Persistent link: https://www.econbiz.de/10011558802
Saved in:
Cover Image
Simulated annealing algorithm for the robust spanning tree problem
Nikulin, Jurij V. - 2005
This paper addresses the robust spanning tree problem with interval data, i.e. the case of classical minimum spanning … spanning tree problem. … experiments. To the best of our knowledge, this is the first attempt to develop a metaheuristic approach for solving the robust …
Persistent link: https://www.econbiz.de/10011725252
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...