scientific article
From MaRDI portal
Publication:3840370
zbMath0911.90153MaRDI QIDQ3840370
Jeffrey D. Oldham, Andrew V. Goldberg, Serge A. Plotkin, Clifford Stein
Publication date: 10 August 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic network models in operations research (90B10)
Related Items (10)
On some difficult linear programs coming from set partitioning ⋮ Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking ⋮ A combinatorial approximation algorithm for supply chain network flow problem ⋮ Unnamed Item ⋮ A fast polynomial time algorithm for logistics network flows ⋮ Fast approximation of minimum multicast congestion – Implementation VERSUS Theory ⋮ A combinatorial approximation algorithm for concurrent flow problem and its application ⋮ Hypermatrix oriented supernode amalgamation ⋮ On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths ⋮ A penalty function heuristic for the resource constrained shortest path problem
Uses Software
This page was built for publication:
