On Bilevel Optimization with Inexact Follower (Q5120277): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Strong-weak nonlinear bilevel problems: existence of solutions in a sequential setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4837999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak linear bilevel programming problems: existence of solutions via a penalty method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple recipe for concise mixed 0-1 linearizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive cuts for continuous linear bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: New branch-and-Cut algorithm for bilevel linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Links between linear bilevel and mixed 0-1 programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical bilevel optimization. Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bilevel programming approach to determining tax credits for biofuel production / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution approach for a class of nonlinear bilevel knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Shortest Path Interdiction with Incomplete Information / 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: A partial cooperation model for non-unique linear two-level decision problems / 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: 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: Enhanced exact algorithms for discrete bilevel linear problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of bilevel optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel programming with knapsack constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4394599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the solution of the 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling a Multitarget Attacker–Defender Game with Budget Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane approach for bilevel hazardous material transport network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of optimal solutions to mathematical programs with equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Models for Multiattribute Choice with Many Alternatives: When It Does and Does Not Pay to Face Trade-offs with Binary Attributes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm 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: Linear bilevel programming with upper level constraints depending on the lower level solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the value of exposure and secrecy of defense system: first-mover advantage vs. robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bilevel knapsack problem with stochastic right-hand sides / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource Allocation for Homeland Defense: Dealing with the Team Effect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid defensive resource allocations in the face of partially strategic attackers in a sequential defender-attacker game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact interdiction models and algorithms for disconnecting networks via node deletions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivable network design under optimal and heuristic interdiction scenarios / 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: Dynamic programming algorithms for the zero-one knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete linear bilevel programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on linearized reformulations for a class of bilevel linear integer problems / 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: A new method for strong-weak linear bilevel programming problem / rank
 
Normal rank

Revision as of 14:38, 23 July 2024

scientific article; zbMATH DE number 7245654
Language Label Description Also known as
English
On Bilevel Optimization with Inexact Follower
scientific article; zbMATH DE number 7245654

    Statements

    On Bilevel Optimization with Inexact Follower (English)
    0 references
    0 references
    0 references
    0 references
    9 September 2020
    0 references
    bilevel optimization
    0 references
    hierarchical optimization
    0 references
    robust optimization
    0 references
    heuristics
    0 references
    defender-attacker problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers