The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective (Q2154452): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-021-01117-9 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1903.02810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of near-optimal robust versions of multilevel optimization problems / 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: Robust combinatorial optimization under convex and discrete cost uncertainty / 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: A polynomial algorithm for a continuous bilevel knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of bilevel optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete-Variable Extremum Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel programming with knapsack constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm for the continuous bilevel knapsack problem / 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: New Branch-and-Bound Rules for Linear Bilevel Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the upper envelope of n line segments in O(n log n) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence, Uniqueness, and Computation of Robust Nash Equilibria in a Class of Multi-Leader-Follower Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closing the gap in linear bilevel optimization: a new valid primal-dual inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / 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: Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pessimistic Bilevel Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of average completion time scheduling under precedence constraints. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of bilevel linear mixed-integer programs in adversarial settings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bilevel knapsack problem with stochastic right-hand sides / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-021-01117-9 / rank
 
Normal rank

Latest revision as of 06:39, 17 December 2024

scientific article
Language Label Description Also known as
English
The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective
scientific article

    Statements

    The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective (English)
    0 references
    0 references
    0 references
    19 July 2022
    0 references
    bilevel optimization
    0 references
    robust optimization
    0 references
    interval order
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references