A branch and price algorithm for a Stackelberg ...
Type de document :
Article dans une revue scientifique: Article original
Titre :
A branch and price algorithm for a Stackelberg Security Game
Auteur(s) :
Lagos, Felipe [Auteur]
Georgia Institute of Technology [Atlanta]
Ordóñez, Fernando [Auteur]
Departamento de Ingenieria Industrial [Santiago] [DII]
Labbé, Martine [Auteur]
Université libre de Bruxelles [ULB]
Integrated Optimization with Complex Structure [INOCS]
Graphes et Optimisation Mathématique [Bruxelles] [GOM]
Georgia Institute of Technology [Atlanta]
Ordóñez, Fernando [Auteur]
Departamento de Ingenieria Industrial [Santiago] [DII]
Labbé, Martine [Auteur]
Université libre de Bruxelles [ULB]
Integrated Optimization with Complex Structure [INOCS]
Graphes et Optimisation Mathématique [Bruxelles] [GOM]
Titre de la revue :
Computers & Industrial Engineering
Pagination :
216 - 227
Éditeur :
Elsevier
Date de publication :
2017-09
ISSN :
0360-8352
Discipline(s) HAL :
Computer Science [cs]/Operations Research [math.OC]
Résumé en anglais : [en]
Mixed integer optimization formulations are an attractive alternative to solve Stackelberg Game problems thanks to the efficiency of state of the art mixed integer algorithms. In particular, decomposition algorithms, such ...
Lire la suite >Mixed integer optimization formulations are an attractive alternative to solve Stackelberg Game problems thanks to the efficiency of state of the art mixed integer algorithms. In particular, decomposition algorithms, such as branch and price methods, make it possible to tackle instances large enough to represent games inspired in real world domians.In this work we focus on Stackelberg Games that arise from a security application and investigate the use of a new branch and price method to solve its mixed integer optimization formulation. We prove that the algorithm provides upper and lower bounds on the optimal solution at every iteration and investigate the use of stabilization heuristics. Our preliminary computational results compare this solution approach with previous decomposition methods obtained from alternative integer programming formulations of Stackelberg games.Lire moins >
Lire la suite >Mixed integer optimization formulations are an attractive alternative to solve Stackelberg Game problems thanks to the efficiency of state of the art mixed integer algorithms. In particular, decomposition algorithms, such as branch and price methods, make it possible to tackle instances large enough to represent games inspired in real world domians.In this work we focus on Stackelberg Games that arise from a security application and investigate the use of a new branch and price method to solve its mixed integer optimization formulation. We prove that the algorithm provides upper and lower bounds on the optimal solution at every iteration and investigate the use of stabilization heuristics. Our preliminary computational results compare this solution approach with previous decomposition methods obtained from alternative integer programming formulations of Stackelberg games.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.inria.fr/hal-01666454/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01666454/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01666454/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- Lagosetal-preprint.pdf
- Accès libre
- Accéder au document
- Lagosetal-preprint.pdf
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- Lagosetal-preprint.pdf
- Accès libre
- Accéder au document