Results 91 to 100 of about 6,474,933 (113)
Learning Primal Heuristics for 0–1 Knapsack Interdiction Problems
In interdiction problems, two opposing decision-makers act sequentially: the leader plays first by selecting items to restrict the choices of the follower, while the follower selects those that maximize her profit from the remaining items.
Ferrarini, Luca +3 more
core +1 more source
An Optimal Modeling Approach for the Interdiction Median Problem with Fortification [PDF]
Church, Richard L. +1 more
core
The multi-terminal maximum-flow network-interdiction problem
This paper defines and studies the multi-terminal maximum-flow network-interdiction problem (MTNIP) in which a network user attempts to maximize flow in a network among K [greater-or-equal, slanted] 3 pre-specified node groups while an interdictor uses ...
Akgün, Ibrahim +2 more
core
The Maximum Clique Interdiction Problem [PDF]
Given a graph G and an interdiction budget k, the Maximum Clique Interdiction Problem asks to find a subset of at most k vertices to remove from G so that the size of the maximum clique in the remaining graph is minimized.
Pablo San Segundo +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A Branch-and-Cut Algorithm for the Edge Interdiction Clique Problem
European Journal of Operational Research, 2021Pablo San Segundo +2 more
exaly
Efficient Solution Methods for a General r-Interdiction Median Problem With Fortification
INFORMS Journal on Computing, 2022Mingzhou Jin, Xueping Li, Kaike Zhang
exaly
Solving the Shortest Path Interdiction Problem via Reinforcement Learning
International Journal of Production Research, 2023Kan Fang, Zhaofang Mao, Lin Chen
exaly
Identifying Critical Infrastructure: The Median and Covering Facility Interdiction Problems
Annals of the American Association of Geographers, 2004Maria Paola Scaparra, Richard L. Church
exaly
A Dynamic Reformulation Heuristic for Generalized Interdiction Problems
European Journal of Operational Research, 2018Matteo Fischetti +2 more
exaly

