Computational comparisons of different formulations for the Stackelberg minimum spanning tree game
From MaRDI portal
Publication:6070408
DOI10.1111/itor.12680OpenAlexW2947796470MaRDI QIDQ6070408
Martine Labbé, Justo Puerto, Miguel A. Pozo
Publication date: 21 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12680
Related Items (5)
On the complexity of the bilevel minimum spanning tree problem ⋮ An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search ⋮ Maximum weighted induced forests and trees: new formulations and a computational comparative review ⋮ A game‐theoretic approach for the location of terror response facilities with both disruption risk and hidden information ⋮ A survey on mixed-integer programming techniques in bilevel optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game
- Specializations and generalizations of the Stackelberg minimum spanning tree game
- The Stackelberg minimum spanning tree game
- Using separation algorithms to generate mixed integer model reformulations
- Ordered weighted average optimization in multiobjective spanning tree problem
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
- An overview of Stackelberg pricing in networks
- An Explicit Solution of a Generalized Optimum Requirement Spanning Tree Problem With a Property Related to Monge
- A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
- Integer Programming Formulation of Traveling Salesman Problems
- Very Simple Methods for All Pairs Network Flow Analysis
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Comparison of metaheuristics for the k‐labeled spanning forest problem
- An approximation algorithm for Stackelberg network pricing
- Bilevel programming and price setting problems
This page was built for publication: Computational comparisons of different formulations for the Stackelberg minimum spanning tree game
