A class of algorithms for mixed-integer bilevel min-max optimization (Q330266): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-015-0274-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2062530151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the most vital arcs in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3989989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3160276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Programming / 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: On two-level optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Level Linear Programming / 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 Complexity and Approximability Study of the Bilevel Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most vital links and nodes in weighted networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Max-Min, with Applications / 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: Maximizing the minimum source-sink path subject to a budget constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: A problem in network interdiction / 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: Shortest-path network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum vertex blocker clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The k most vital arcs in the shortest path problem / 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: Finding the <i>n</i> Most Vital Links in Flow Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete linear bilevel programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approaches to sensitivity analysis in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the continuity of the value of a linear program and of related polyhedral-valued multifunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing Arcs from a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network interdiction / rank
 
Normal rank

Latest revision as of 19:53, 12 July 2024

scientific article
Language Label Description Also known as
English
A class of algorithms for mixed-integer bilevel min-max optimization
scientific article

    Statements

    A class of algorithms for mixed-integer bilevel min-max optimization (English)
    0 references
    0 references
    0 references
    25 October 2016
    0 references
    bilevel programming
    0 references
    interdiction problems
    0 references
    integer programing
    0 references
    algorithms
    0 references
    0 references
    0 references
    0 references

    Identifiers