A hybrid tabu-ascent algorithm for the linear bilevel programming problem (Q1815061): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Patrice Marcotte / rank
Normal rank
 
Property / author
 
Property / author: Gilles Savard / rank
Normal rank
 
Property / author
 
Property / author: Patrice Marcotte / rank
 
Normal rank
Property / author
 
Property / author: Gilles Savard / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: XMP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solution method for the linear static Stackelberg problem using penalty functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for the Bilevel Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two-level optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / 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: A Note on: An Efficient Point Algorithm for a Linear Two-Stage Optimization 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: A sequential LCP method for bilevel linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithm based approach to bi-level linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel approaches to the discrimination problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steepest descent direction for the nonlinear bilevel programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel and multilevel programming: A bibliography review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descent approaches for quadratic bilevel programming / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00121266 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093490324 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:56, 30 July 2024

scientific article
Language Label Description Also known as
English
A hybrid tabu-ascent algorithm for the linear bilevel programming problem
scientific article

    Statements

    A hybrid tabu-ascent algorithm for the linear bilevel programming problem (English)
    0 references
    0 references
    0 references
    0 references
    10 April 1997
    0 references
    linear bilevel programming
    0 references
    linear hirarchical decision process
    0 references
    NP-hard problem
    0 references
    adaptive search
    0 references
    Tabu Search
    0 references

    Identifiers

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