相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Interdiction Games and Monotonicity, with Application to Knapsack Problems
Matteo Fischetti et al.
INFORMS JOURNAL ON COMPUTING (2019)
A Backward Sampling Framework for Interdiction Problems with Fortification
Leonardo Lozano et al.
INFORMS JOURNAL ON COMPUTING (2017)
A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
Mehdi Hemmati et al.
DISCRETE OPTIMIZATION (2016)
Bilevel Knapsack with Interdiction Constraints
Alberto Caprara et al.
INFORMS JOURNAL ON COMPUTING (2016)
Intersection Cuts for Bilevel Optimization
Matteo Fischetti et al.
INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2016 (2016)
Enhanced exact algorithms for discrete bilevel linear problems
Massimiliano Caramia et al.
OPTIMIZATION LETTERS (2015)
An O(1)-Approximation for Minimum Spanning Tree Interdiction
Rico Zenklusen
2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (2015)
A cutting-plane algorithm for solving a weighted influence interdiction problem
Mehdi Hemmati et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2014)
Connectivity interdiction
Rico Zenklusen
OPERATIONS RESEARCH LETTERS (2014)
Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth
Bernardetta Addis et al.
DISCRETE APPLIED MATHEMATICS (2013)
One-level reformulation of the bilevel Knapsack problem using dynamic programming
Luce Brotcorne et al.
DISCRETE OPTIMIZATION (2013)
Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
Ibrahim Muter et al.
MATHEMATICAL PROGRAMMING (2013)
The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
S. Dempe et al.
MATHEMATICAL PROGRAMMING (2013)
Exact interdiction models and algorithms for disconnecting networks via node deletions
Siqian Shen et al.
DISCRETE OPTIMIZATION (2012)
Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
Siqian Shen et al.
NETWORKS (2012)
Complexity of the critical node problem over trees
Marco Di Summa et al.
COMPUTERS & OPERATIONS RESEARCH (2011)
The most vital nodes with respect to independent set and vertex cover
Cristina Bazgan et al.
DISCRETE APPLIED MATHEMATICS (2011)
Optimal Allocation of Protective Resources in Shortest-Path Networks
Paola Cappanera et al.
TRANSPORTATION SCIENCE (2011)
Network flow interdiction on planar graphs
R. Zenklusen
DISCRETE APPLIED MATHEMATICS (2010)
Matching interdiction
Rico Zenklusen
DISCRETE APPLIED MATHEMATICS (2010)
0-1 reformulations of the multicommodity capacitated network design problem
Antonio Frangioni et al.
DISCRETE APPLIED MATHEMATICS (2009)
Worst-Case Interdiction Analysis of Large-Scale Electric Power Grids
Javier Salmeron et al.
IEEE TRANSACTIONS ON POWER SYSTEMS (2009)
A bilevel mixed-integer program for critical infrastructure protection planning
Maria P. Scaparra et al.
COMPUTERS & OPERATIONS RESEARCH (2008)
An exact solution approach for the interdiction median problem with fortification
Maria P. Scaparra et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2008)
On short paths interdiction problems: Total and node-wise limited interdiction
Leonid Khachiyan et al.
THEORY OF COMPUTING SYSTEMS (2008)
Survivable network design under optimal and heuristic interdiction scenarios
J. Cole Smith et al.
JOURNAL OF GLOBAL OPTIMIZATION (2007)
Models for nuclear smuggling interdiction
David P. Morton et al.
IIE TRANSACTIONS (2007)
Algorithms for discrete and continuous multicommodity flow network interdiction problems
Churlzu Lim et al.
IIE TRANSACTIONS (2007)
Identifying critical infrastructure: The median and covering facility interdiction problems
RL Church et al.
ANNALS OF THE ASSOCIATION OF AMERICAN GEOGRAPHERS (2004)
Shortest-path network interdiction
E Israeli et al.
NETWORKS (2002)
分享论文
