Integer linear programming formulations for the maximum flow blocker problem

Cites work

scientific article; zbMATH DE number 3639144 (Why is no real title available?)
scientific article; zbMATH DE number 1487883 (Why is no real title available?)
A branch-and-cut algorithm for the edge interdiction clique problem
A new general-purpose algorithm for mixed-integer bilevel linear programs
A simpler and faster strongly polynomial algorithm for generalized flow maximization
A strongly polynomial minimum cost circulation algorithm
A survey of network interdiction models and algorithms
Bilevel optimization: theory, algorithms, applications and a bibliography
Combinatorial optimization. Polyhedra and efficiency (3 volumes)
Deterministic network interdiction
Integer programming methods for solving binary interdiction games
Minimum vertex blocker clique problem
Most vital vertices for the shortest s-t path problem: complexity and branch-and-cut algorithm
Network flows. Theory, algorithms, and applications.
On the history of the transportation and maximum flow problems
On the use of intersection cuts for bilevel optimization
Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
Optimal interdiction of a supply network
Removing Arcs from a Network
Shortest-path network interdiction
Solving the bi-objective maximum-flow network-interdiction problem
Stochastic maximum flow interdiction problems under heterogeneous risk preferences
Stochastic network interdiction
The integer \(L\)-shaped method for stochastic integer programs with complete recourse
The maximum clique interdiction problem
The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability

This page was built for publication: Integer linear programming formulations for the maximum flow blocker problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6981414)