The recoverable robust spanning tree problem with interval costs is polynomially solvable
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1862-4480
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
The recoverable robust spanning tree problem with interval costs is polynomially solvable ; day:4 ; month:7 ; year:2016 ; pages:1-14
Optimization letters ; (4.7.2016), 1-14
- Creator
-
Hradovich, Mikita
- Contributor
- DOI
-
10.1007/s11590-016-1057-x
- URN
-
urn:nbn:de:1111-201607063286
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:57 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Hradovich, Mikita
- Kasperski, Adam
- Zieliński, Paweł
- SpringerLink (Online service)
Other Objects (12)
Recoverable robust spanning tree problem under interval uncertainty representations
Simulated annealing algorithm for the robust spanning tree problem
A solvable two-dimensional singular stochastic control problem with non convex costs
A solvable two-dimensional singular stochastic control problem with non convex costs
Solvable polynomial rings
A solvable two-dimensional degenerate singular stochastic control problem with non convex costs
A solvable two-dimensional degenerate singular stochastic control problem with non convex costs
Stochastic spanning
Solvable Dyson-Schwinger Equations
(Un)Solvable loop analysis
Dominance-solvable lattice games
New solvable dynamical systems
Recoverable robust spanning tree problem under interval uncertainty representations
Simulated annealing algorithm for the robust spanning tree problem
A solvable two-dimensional singular stochastic control problem with non convex costs
A solvable two-dimensional singular stochastic control problem with non convex costs
Solvable polynomial rings
A solvable two-dimensional degenerate singular stochastic control problem with non convex costs
A solvable two-dimensional degenerate singular stochastic control problem with non convex costs
Stochastic spanning
Solvable Dyson-Schwinger Equations
(Un)Solvable loop analysis
Dominance-solvable lattice games
New solvable dynamical systems
Recoverable robust spanning tree problem under interval uncertainty representations
Simulated annealing algorithm for the robust spanning tree problem
A solvable two-dimensional singular stochastic control problem with non convex costs
A solvable two-dimensional singular stochastic control problem with non convex costs
Solvable polynomial rings
A solvable two-dimensional degenerate singular stochastic control problem with non convex costs
A solvable two-dimensional degenerate singular stochastic control problem with non convex costs
Stochastic spanning
Solvable Dyson-Schwinger Equations
(Un)Solvable loop analysis
Dominance-solvable lattice games