scientific article; zbMATH DE number 2037815
From MaRDI portal
Publication:4448919
zbMath1078.90043MaRDI QIDQ4448919
Publication date: 3 February 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (8)
Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems ⋮ Approximation Algorithms for Generalized MST and TSP in Grid Clusters ⋮ Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem ⋮ The geometric generalized minimum spanning tree problem with grid clustering ⋮ A tabu search heuristic for the generalized minimum spanning tree problem ⋮ Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem ⋮ On the prize-collecting generalized minimum spanning tree problem ⋮ A new relaxation method for the generalized minimum spanning tree problem
This page was built for publication:
