scientific article

From MaRDI portal

Revision as of 00:46, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3998318

Jump to:navigation, search

zbMath0733.05049MaRDI QIDQ3998318

Stefan Voß

Publication date: 17 September 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph theory geometrical Steiner problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Linear programming (90C05) Dynamic programming (90C39) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (9)

An exact branch and bound algorithm for the Steiner Problem in Graphs ⋮ Steiner's problem in graphs: Heuristic methods ⋮ The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic ⋮ Steiner trees and polyhedra ⋮ Unnamed Item ⋮ Approaches to the Steiner Problem in Networks ⋮ Worst-case performance of some heuristics for Steiner's problem in directed graphs ⋮ Steiner's problem in double trees ⋮ Looking ahead with the pilot method

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3998318&oldid=17689122"