An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1811.02822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-level reformulation of the bilevel Knapsack problem using dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity and Approximability Study of the Bilevel Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel Knapsack with Interdiction Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced exact algorithms for discrete bilevel linear problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for a continuous bilevel knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for a bi-level knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the product knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pinpointing the complexity of the interval min-max regret knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New exact approaches and approximation results for the penalized knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for the 0-1 knapsack problem with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new exact approach for the 0-1 collapsing knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interdiction Games and Monotonicity, with Application to Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of intersection cuts for bilevel optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic reformulation heuristic for generalized interdiction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact approaches for the knapsack problem with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial hierarchy and a simple model for competitive analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mixed Integer Linear Bilevel Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Stackelberg knapsack game with weight control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved dynamic programming and approximation results for the knapsack problem with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for strongly correlated knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Knapsack Problems with Bounded Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for a bilevel knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of algorithms for mixed-integer bilevel min-max optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions / rank
 
Normal rank

Latest revision as of 10:20, 23 July 2024

scientific article
Language Label Description Also known as
English
An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
scientific article

    Statements

    An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (English)
    0 references
    28 August 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    bilevel programming
    0 references
    exact approach
    0 references
    bilevel knapsack with interdiction constraints
    0 references
    min-max regret knapsack problem
    0 references
    0 references
    0 references
    0 references
    0 references