scientific article; zbMATH DE number 2050722
From MaRDI portal
Publication:4452913
zbMath1051.90005MaRDI QIDQ4452913
Carl Burch, Madhav V. Marathe, Robert D. Carr, Sven O. Krumke, Eric Lars Sundberg, Cynthia A. Phillips
Publication date: 7 March 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear programminginteger programmingminimum cutpolynomial-time algorithmmulticriteria optimizationinteger programlinear-programming relaxationnetwork inhibition problempseudoapproximation algorithm
Integer programming (90C10) Stochastic network models in operations research (90B15) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (17)
Interdicting facilities in tree networks ⋮ Matching interdiction ⋮ Vertex downgrading to minimize connectivity ⋮ Interdiction problems on planar graphs ⋮ Approximation algorithms for \(k\)-hurdle problems ⋮ Models and methods for solving the problem of network vulnerability ⋮ Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives ⋮ Protection of flows under targeted attacks ⋮ Bilevel model for adaptive network flow problem ⋮ Parametric multiroute flow and its application to multilink-attack network ⋮ The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability ⋮ Network flow interdiction on planar graphs ⋮ On the power of randomization in network interdiction ⋮ Approximation Algorithms for k-Hurdle Problems ⋮ An approximation algorithm for network flow interdiction with unit costs and two capacities ⋮ A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities ⋮ Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
This page was built for publication:
