scientific article; zbMATH DE number 1538542
From MaRDI portal
Publication:4519136
DOI<138::AID-NET9>3.0.CO;2-U 10.1002/1097-0037(200009)36:2<138::AID-NET9>3.0.CO;2-UzbMath0960.90077MaRDI QIDQ4519136
Mauricio C. de Souza, Celso Carneiro Ribeiro
Publication date: 3 December 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Search theory (90B40) Combinatorial optimization (90C27)
Related Items (8)
A robust and scalable algorithm for the Steiner problem in graphs ⋮ A tabu search approach for solving a difficult forest harvesting machine location problem ⋮ Minimax regret spanning arborescences under uncertain costs ⋮ The rainbow Steiner tree problem ⋮ Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Optimizing the Design of a Wind Farm Collection Network ⋮ A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
Cites Work
This page was built for publication:
