Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives
From MaRDI portal
Publication:2976146
DOI10.1287/moor.2016.0798zbMath1359.90114arXiv1511.02484OpenAlexW2962824589MaRDI QIDQ2976146
Rico Zenklusen, Stephen R. Chestnut
Publication date: 13 April 2017
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.02484
Multi-objective and goal programming (90C29) Combinatorics in computer science (68R05) Combinatorial optimization (90C27)
Related Items (6)
Interdicting facilities in tree networks ⋮ Integer Programming Formulations for Minimum Spanning Tree Interdiction ⋮ Vertex downgrading to minimize connectivity ⋮ Parametric matroid interdiction ⋮ On the hardness of covering-interdiction problems ⋮ An approximation algorithm for network flow interdiction with unit costs and two capacities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New approaches to multi-objective optimization
- The most vital nodes with respect to independent set and vertex cover
- Matching interdiction
- On short paths interdiction problems: Total and node-wise limited interdiction
- Network flow interdiction on planar graphs
- On the diameter of the edge cover polytope
- Connectivity interdiction
- Deterministic network interdiction
- Finding the most vital arcs in a network
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems
- Interdiction Problems on Planar Graphs
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
- Relations between average case complexity and approximation complexity
- Combinatorial Optimization with Rational Objective Functions
- Computing Maximal “Polymatroidal” Network Flows
- Hardness and approximation for network flow interdiction
- Packing Interdiction and Partial Covering Problems
- The network inhibition problem
- On Budgeted Optimization Problems
- Removing Arcs from a Network
- Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
- On the history of the transportation and maximum flow problems
- Extended formulations in combinatorial optimization
This page was built for publication: Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives
