scientific article

zbMath0622.90029MaRDI QIDQ3760270

Nelson F. Maculan

Publication date: 1987

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

zbMATH Keywords

surveybranch-and-boundundirected graphLagrangean relaxationsfacility location on graphsSteiner Problem

Mathematics Subject Classification ID

Trees (05C05) Numerical mathematical programming methods (65K05) Integer programming (90C10) Inventory, storage, reservoirs (90B05)

Related Items (32)

Preprocessing Steiner problems from VLSI layout ⋮ Greedy algorithms for the on-line steiner tree and generalized steiner problems ⋮ Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem ⋮ An edge elimination test for the Steiner problem in graphs ⋮ A constrained Steiner tree problem ⋮ A look at the past and present of optimization - an editorial ⋮ The Performance of greedy algorithms for the on-line steiner tree and related problems ⋮ Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic ⋮ Lagrangian relaxation for maximum service in multicast routing with QoS constraints ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints ⋮ Vertex covering with capacitated trees ⋮ Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem ⋮ Tree network design avoiding congestion ⋮ Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs ⋮ Network design with a discrete set of traffic matrices ⋮ An approach for the Steiner problem in directed graphs ⋮ Facets of two Steiner arborescence polyhedra ⋮ Linear bounds for on-line Steiner problems ⋮ Binary Steiner trees: structural results and an exact solution approach ⋮ Steiner trees with \(n\) terminals among \(n+1\) nodes ⋮ Survivable networks, linear programming relaxations and the parsimonious property ⋮ Worst-case performance of Wong's Steiner tree heuristic ⋮ New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints ⋮ A comparison of Steiner tree relaxations ⋮ The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation ⋮ Class Steiner trees and VLSI-design ⋮ Algorithms for a multi-level network optimization problem ⋮ Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study ⋮ Clustering heuristics for set covering ⋮ Directed Steiner problems with connectivity constraints ⋮ Non delayed relax-and-cut algorithms

This page was built for publication: