Computational comparisons of different formulations for the Stackelberg minimum spanning tree game (Q6070408): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An Explicit Solution of a Generalized Optimum Requirement Spanning Tree Problem With a Property Related to Monge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specializations and generalizations of the Stackelberg minimum spanning tree game / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stackelberg minimum spanning tree game / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria path and tree problems: discussion on exact algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of metaheuristics for the <i>k</i>‐labeled spanning forest problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered weighted average optimization in multiobjective spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very Simple Methods for All Pairs Network Flow Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel programming and price setting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using separation algorithms to generate mixed integer model reformulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for Stackelberg network pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of Stackelberg pricing in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4610958 / rank
 
Normal rank

Revision as of 13:01, 19 August 2024

scientific article; zbMATH DE number 7768498
Language Label Description Also known as
English
Computational comparisons of different formulations for the Stackelberg minimum spanning tree game
scientific article; zbMATH DE number 7768498

    Statements

    Computational comparisons of different formulations for the Stackelberg minimum spanning tree game (English)
    0 references
    0 references
    0 references
    0 references
    21 November 2023
    0 references
    minimum spanning tree
    0 references
    bilevel optimization
    0 references
    Stackelberg game
    0 references
    0 references
    0 references
    0 references

    Identifiers