scientific article; zbMATH DE number 1947385

zbMath1040.90044MaRDI QIDQ4411349

Ekkehard Köhler, Martin Skutella, Georg Baier

Publication date: 8 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2461/24610101.htm

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (9)

Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem ⋮ A polynomial time approximation algorithm for the two-commodity splittable flow problem ⋮ Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem ⋮ A multi-start variable neighborhood search for solving the single path multicommodity flow problem ⋮ Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs. ⋮ A Branch and Price algorithm for the \(k\)-splittable maximum flow problem ⋮ Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths ⋮ Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem ⋮ Minimum-Cost Single-Source 2-Splittable Flow

This page was built for publication: