Solution techniques for bi-level knapsack problems (Q6047889): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2023.106343 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Mathematical Programs with Optimization Problems in the Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stackelberg pricing with computationally bounded customers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for the bilevel Knapsack problem / 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 Study on the Computational Complexity 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: Approximation algorithms for a bi-level knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel programming: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Frequencies in a Transit Network: a Nonlinear Bi‐level Programming Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for the bilevel knapsack problem with interdiction constraints and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel programming with knapsack constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel optimization. Advances and next challenges / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the mixed-integer nonlinear bilevel programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel programming with discrete lower level problems / 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: On the use of intersection cuts for bilevel optimization / 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: A Representation and Economic Interpretation of a Two-Level Programming Problem / 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: The polynomial hierarchy and a simple model for competitive analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on mixed-integer programming techniques in bilevel optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric integer programming algorithm for bilevel mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An enhanced branch-and-bound algorithm for bilevel integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for bilevel 0-1 knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear bilevel programming with upper level constraints depending on the lower level solution / 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: On the Stackelberg knapsack game / 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 branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete linear bilevel programming problem / 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
Property / DOI
 
Property / DOI: 10.1016/J.COR.2023.106343 / rank
 
Normal rank

Latest revision as of 17:56, 30 December 2024

scientific article; zbMATH DE number 7737022
Language Label Description Also known as
English
Solution techniques for bi-level knapsack problems
scientific article; zbMATH DE number 7737022

    Statements

    Solution techniques for bi-level knapsack problems (English)
    0 references
    0 references
    0 references
    0 references
    13 September 2023
    0 references
    bi-level optimization
    0 references
    bi-level knapsack problems
    0 references
    Stackelberg games
    0 references
    healthcare economics
    0 references

    Identifiers