scientific article; zbMATH DE number 1487883
From MaRDI portal
Publication:4494412
zbMath0965.90006MaRDI QIDQ4494412
R. Ravi, S. Schwarz, Hans-Christoph Wirth, Hartmut Noltemeier, Sven O. Krumke
Publication date: 10 August 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)
Related Items
An automated network generation procedure for routing of unmanned aerial vehicles (UAVs) in a GIS environment ⋮ The minimum vulnerability problem on specific graph classes ⋮ Optimizing cost flows by edge cost and capacity upgrade ⋮ The Minimum Vulnerability Problem on Graphs ⋮ Finding paths with minimum shared edges ⋮ Approximation algorithms for \(k\)-hurdle problems ⋮ Reverse maximum flow problem under the weighted Chebyshev distance ⋮ The minimum vulnerability problem ⋮ The minimum shift design problem ⋮ Complexity analysis for maximum flow problems with arc reversals ⋮ Approximation Algorithms for k-Hurdle Problems ⋮ Resource allocation by means of project networks: Dominance results ⋮ On the flow cost lowering problem
