Deep learning based high accuracy heuristic approach for knapsack interdiction problem
From MaRDI portal
Cites work
- A graph reinforcement learning framework for neural adaptive large neighbourhood search
- A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- A note on linearized reformulations for a class of bilevel linear integer problems
- A simple greedy heuristic for linear assignment interdiction
- A study on the computational complexity of the bilevel knapsack problem
- A survey on mixed-integer programming techniques in bilevel optimization
- An exact algorithm for bilevel 0-1 knapsack problems
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- An overview of Stackelberg pricing in networks
- Approximation algorithms for a bi-level knapsack problem
- Bilevel knapsack with interdiction constraints
- Bilevel programming with knapsack constraints
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- Improved approximation algorithms for a bilevel knapsack problem
- Interdicting a Nuclear-Weapons Project
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Metaheuristics for bilevel optimization: a comprehensive review
- Minimizing a stochastic maximum-reliability path
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem
- One-level reformulation of the bilevel Knapsack problem using dynamic programming
- The Mixed Integer Linear Bilevel Programming Problem
- The polynomial hierarchy and a simple model for competitive analysis
Cited in
(2)
This page was built for publication: Deep learning based high accuracy heuristic approach for knapsack interdiction problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6974934)
