- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1862-4480
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Polyhedral results and stronger Lagrangean bounds for stable spanning trees ; day:11 ; month:11 ; year:2022 ; pages:1-19
Optimization letters ; (11.11.2022), 1-19
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s11590-022-01949-8
- URN
-
urn:nbn:de:101:1-2023012521182332843228
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:39 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
- Samer, Phillippe
- Haugland, Dag
- SpringerLink (Online service)
Other Objects (12)
A Stronger Lower Bound on Parametric Minimum Spanning Trees
Stable determination of polygonal and polyhedral interfaces from boundary measurements
The Quadratic Minimum Spanning Tree Problem: Lower Bounds via Extended Formulations
Stronger Women, Stronger Nations : 2008 Iraq Report
Polyhedral inclusion-exclusion
Stochastic spanning
Stronger Utility
Error bound analysis for vector equilibrium problems with partial order provided by a polyhedral cone
The polyhedral projection problem
Rooted Spanning Superpixels
A Tight Bound for the Complexity of Voronoi Diagrams under Polyhedral Convex Distance Functions in 3D
An upper bound for the pseudoisotopy stable range
A Stronger Lower Bound on Parametric Minimum Spanning Trees
Stable determination of polygonal and polyhedral interfaces from boundary measurements
The Quadratic Minimum Spanning Tree Problem: Lower Bounds via Extended Formulations
Stronger Women, Stronger Nations : 2008 Iraq Report
Polyhedral inclusion-exclusion
Stochastic spanning
Stronger Utility
Error bound analysis for vector equilibrium problems with partial order provided by a polyhedral cone
The polyhedral projection problem
Rooted Spanning Superpixels
A Tight Bound for the Complexity of Voronoi Diagrams under Polyhedral Convex Distance Functions in 3D
An upper bound for the pseudoisotopy stable range
A Stronger Lower Bound on Parametric Minimum Spanning Trees
Stable determination of polygonal and polyhedral interfaces from boundary measurements
The Quadratic Minimum Spanning Tree Problem: Lower Bounds via Extended Formulations
Stronger Women, Stronger Nations : 2008 Iraq Report
Polyhedral inclusion-exclusion
Stochastic spanning
Stronger Utility
Error bound analysis for vector equilibrium problems with partial order provided by a polyhedral cone
The polyhedral projection problem
Rooted Spanning Superpixels
A Tight Bound for the Complexity of Voronoi Diagrams under Polyhedral Convex Distance Functions in 3D