{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:39:26Z","timestamp":1762292366273,"version":"build-2065373602"},"reference-count":43,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100012950","name":"Institut National de Recherche en Sciences et Technologies du Num\u00e9rique","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100012950","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009610","name":"Pontificia Universidad Catolica de Chile","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100009610","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100020884","name":"ANID","doi-asserted-by":"publisher","award":["ANID PIA\/PUENTE AFB230002"],"award-info":[{"award-number":["ANID PIA\/PUENTE AFB230002"]}],"id":[{"id":"10.13039\/501100020884","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002848","name":"Comisi\u00f3n Nacional de Investigaci\u00f3n Cient\u00edfica y Tecnol\u00f3gica","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002848","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002850","name":"Fondo Nacional de Desarrollo Cient\u00edfico y Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["1220047"],"award-info":[{"award-number":["1220047"]}],"id":[{"id":"10.13039\/501100002850","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1016\/j.cor.2025.107122","type":"journal-article","created":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T13:48:01Z","timestamp":1750168081000},"page":"107122","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Novel valid inequalities and branch-and-price for Stackelberg security games"],"prefix":"10.1016","volume":"183","author":[{"ORCID":"https:\/\/linproxy.fan.workers.dev:443\/https\/orcid.org\/0000-0002-8343-1804","authenticated-orcid":false,"given":"Pamela","family":"Bustamante-Fa\u00fandez","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/linproxy.fan.workers.dev:443\/https\/orcid.org\/0000-0002-3043-8404","authenticated-orcid":false,"given":"V\u00edctor","family":"Bucarey L.","sequence":"additional","affiliation":[]},{"given":"Martine","family":"Labb\u00e9","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/linproxy.fan.workers.dev:443\/https\/orcid.org\/0000-0002-5343-0106","authenticated-orcid":false,"given":"Vladimir","family":"Marianov","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Ordo\u00f1ez","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"2021","author":"Arriagada Fritz","series-title":"Benders Decomposition Based Algorithms for General and Security Stackelberg Games","key":"10.1016\/j.cor.2025.107122_b1"},{"year":"2013","author":"Bard","series-title":"Practical Bilevel Optimization: Algorithms and Applications","key":"10.1016\/j.cor.2025.107122_b2"},{"issue":"3","key":"10.1016\/j.cor.2025.107122_b3","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1016\/j.ejor.2021.05.043","article-title":"A branch-and-price procedure for clustering data that are graph connected","volume":"297","author":"Benati","year":"2022","journal-title":"European J. Oper. Res."},{"year":"2021","author":"Bestuzheva","series-title":"The SCIP Optimization Suite 8.0","key":"10.1016\/j.cor.2025.107122_b4"},{"key":"10.1016\/j.cor.2025.107122_b5","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105310","article-title":"Continuous maximal covering location problems with interconnected facilities","volume":"132","author":"Blanco","year":"2021","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2025.107122_b6","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.ejor.2022.07.020","article-title":"A branch-and-price approach for the continuous multifacility monotone ordered median problem","volume":"306","author":"Blanco","year":"2023","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107122_b7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF00939867","article-title":"Sequential Stackelberg equilibria in two-person games","volume":"59","author":"Breton","year":"1985","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.cor.2025.107122_b8","article-title":"Coordinating resources in Stackelberg security games","author":"Bucarey","year":"2019","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107122_b9","series-title":"International Conference on Decision and Game Theory for Security","first-page":"97","article-title":"Discussion of fairness and implementability in Stackelberg security games","author":"Bucarey","year":"2019"},{"key":"10.1016\/j.cor.2025.107122_b10","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2024.103068","article-title":"Playing Stackelberg security games in perfect formulations","volume":"126","author":"Bustamante-Fa\u00fandez","year":"2024","journal-title":"Omega"},{"issue":"2","key":"10.1016\/j.cor.2025.107122_b11","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/ijoc.2015.0676","article-title":"Bilevel Knapsack with interdiction constraints","volume":"28","author":"Caprara","year":"2016","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"10.1016\/j.cor.2025.107122_b12","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1016\/j.ejor.2019.05.012","article-title":"A study of general and security Stackelberg game formulations","volume":"278","author":"Casorr\u00e1n","year":"2019","journal-title":"European J. Oper. Res."},{"issue":"5","key":"10.1016\/j.cor.2025.107122_b13","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1007\/s00453-019-00648-8","article-title":"Computing a pessimistic Stackelberg equilibrium with multiple followers: The mixed-pure case","volume":"82","author":"Coniglio","year":"2020","journal-title":"Algorithmica"},{"key":"10.1016\/j.cor.2025.107122_b14","series-title":"Proceedings of the 7th ACM Conference on Electronic Commerce","first-page":"82","article-title":"Computing the optimal strategy to commit to","author":"Conitzer","year":"2006"},{"key":"10.1016\/j.cor.2025.107122_b15","series-title":"Proceedings of the 7th ACM Conference on Electronic Commerce","first-page":"82","article-title":"Computing the optimal strategy to commit to","author":"Conitzer","year":"2006"},{"issue":"2","key":"10.1016\/j.cor.2025.107122_b16","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","article-title":"Discrete-variable extremum problems","volume":"5","author":"Dantzig","year":"1957","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2025.107122_b17","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1287\/ijoc.2019.0915","article-title":"A branch-price-and-cut procedure for the discrete ordered median problem","volume":"32","author":"Deleplanque","year":"2020","journal-title":"INFORMS J. Comput."},{"year":"2002","author":"Dempe","series-title":"Foundations of Bilevel Programming","key":"10.1016\/j.cor.2025.107122_b18"},{"year":"2011","author":"DeNegre","series-title":"Interdiction and Discrete Bilevel Linear Programming","key":"10.1016\/j.cor.2025.107122_b19"},{"key":"10.1016\/j.cor.2025.107122_b20","series-title":"Proceedings of the 24th International Conference on Artificial Intelligence","first-page":"2589","article-title":"When security games go green: Designing defender strategies to prevent poaching and illegal fishing","author":"Fang","year":"2015"},{"key":"10.1016\/j.cor.2025.107122_b21","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","article-title":"Greedy randomized adaptive search procedures","volume":"6","author":"Feo","year":"1995","journal-title":"J. Global Optim."},{"issue":"2","key":"10.1016\/j.cor.2025.107122_b22","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1287\/ijoc.2018.0831","article-title":"Interdiction games and monotonicity, with application to Knapsack problems","volume":"31","author":"Fischetti","year":"2019","journal-title":"INFORMS J. Comput."},{"unstructured":"Gan, J., An, B., 2014. Minimum support size of the defender\u2019s strong Stackelberg equilibrium strategies in security games. In: Proc. AAAI Spring Symp. on Appl. Computat. Game Theory.","key":"10.1016\/j.cor.2025.107122_b23"},{"key":"10.1016\/j.cor.2025.107122_b24","first-page":"2020","article-title":"On the inducibility of Stackelberg equilibrium for security games","volume":"vol. 33","author":"Guo","year":"2019"},{"issue":"7","key":"10.1016\/j.cor.2025.107122_b25","first-page":"37","article-title":"Parallel algorithm to find the Stackelberg equilibrium profiles in the three stage dynamic games with discrete payoff functions","volume":"37","author":"Hancu","year":"2010","journal-title":"Stud. Univ. Mold. ( Ser. \u015etiin \u0162e Exacte \u015ei Economice)"},{"doi-asserted-by":"crossref","unstructured":"Jain, M., Kardes, E., Kiekintveld, C., Tambe, M., Ordonez, F., 2010. Security Games with Arbitrary Schedules: A Branch and Price Approach. In: National Conference on Artificial Intelligence. AAAI.","key":"10.1016\/j.cor.2025.107122_b26","DOI":"10.1609\/aaai.v24i1.7611"},{"key":"10.1016\/j.cor.2025.107122_b27","series-title":"Handbook of Dynamic Game Theory","first-page":"1","article-title":"Trends and applications in Stackelberg security games","author":"Kar","year":"2017"},{"key":"10.1016\/j.cor.2025.107122_b28","series-title":"Knapsack Problems","first-page":"117","article-title":"Exact solution of the Knapsack problem","author":"Kellerer","year":"2004"},{"key":"10.1016\/j.cor.2025.107122_b29","series-title":"Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems-Volume 1","first-page":"689","article-title":"Computing optimal randomized resource allocations for massive security games","author":"Kiekintveld","year":"2009"},{"issue":"1","key":"10.1016\/j.cor.2025.107122_b30","first-page":"805","article-title":"Complexity of computing optimal Stackelberg strategies in security resource allocation games","volume":"24","author":"Korzhyk","year":"2010","journal-title":"Proc. the AAAI Conf. Artif. Intell."},{"key":"10.1016\/j.cor.2025.107122_b31","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.cie.2017.06.034","article-title":"A branch and price algorithm for a Stackelberg security game","volume":"111","author":"Lagos","year":"2017","journal-title":"Comput. Ind. Eng."},{"year":"2016","author":"Li","series-title":"Catcher-evader games","key":"10.1016\/j.cor.2025.107122_b32"},{"issue":"9","key":"10.1016\/j.cor.2025.107122_b33","doi-asserted-by":"crossref","first-page":"5271","DOI":"10.1109\/TAC.2022.3220512","article-title":"Stationary strong Stackelberg equilibrium in discounted stochastic games","volume":"68","author":"L\u00f3pez","year":"2023","journal-title":"IEEE Trans. Autom. Control"},{"key":"10.1016\/j.cor.2025.107122_b34","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF00121269","article-title":"Weak via strong Stackelberg problem: New results","volume":"8","author":"Loridan","year":"1996","journal-title":"J. Global Optim."},{"issue":"1","key":"10.1016\/j.cor.2025.107122_b35","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/j.ejor.2004.06.011","article-title":"Dynamic programming approach to discrete time dynamic feedback Stackelberg games with independent and dependent followers","volume":"169","author":"Nie","year":"2006","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107122_b36","series-title":"Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems-Volume 2","first-page":"895","article-title":"Playing games for security: An efficient exact algorithm for solving Bayesian Stackelberg games","author":"Paruchuri","year":"2008"},{"key":"10.1016\/j.cor.2025.107122_b37","series-title":"Experimental Algorithms: 12th International Symposium, SEA 2013, Rome, Italy, June 5-7, 2013. Proceedings 12","first-page":"354","article-title":"In-out separation and column generation stabilization by dual price smoothing","author":"Pessoa","year":"2013"},{"key":"10.1016\/j.cor.2025.107122_b38","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s12532-010-0019-z","article-title":"Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems","volume":"2","author":"Pessoa","year":"2010","journal-title":"Math. Program. Comput."},{"key":"10.1016\/j.cor.2025.107122_b39","first-page":"37","article-title":"IRIS-a tool for strategic security allocation in transportation networks","author":"Tsai","year":"2009","journal-title":"AAMAS (Ind. Track)"},{"issue":"3","key":"10.1016\/j.cor.2025.107122_b40","first-page":"70","article-title":"Stackelberg security games: Models, applications and computational aspects","author":"Wilczy\u0144ski","year":"2016","journal-title":"J. Telecommun. Inf. Technol."},{"unstructured":"Yang, R., Xin Jiang, A., Tambe, M., Ord\u00f3nez, F., 2013. Scaling-up Security Games with Boundedly Rational Adversaries: A Cutting-plane Approach. In: International Joint Conference on Artificial Intelligence. IJCAI.","key":"10.1016\/j.cor.2025.107122_b41"},{"key":"10.1016\/j.cor.2025.107122_b42","doi-asserted-by":"crossref","DOI":"10.1016\/j.dss.2021.113599","article-title":"Bayesian Stackelberg games for cyber-security decision support","volume":"148","author":"Zhang","year":"2021","journal-title":"Decis. Support Syst."},{"issue":"3","key":"10.1016\/j.cor.2025.107122_b43","doi-asserted-by":"crossref","first-page":"1523","DOI":"10.1016\/j.jfranklin.2022.12.013","article-title":"Trilayer Stackelberg game for nonlinear systems using adaptive dynamic programming","volume":"360","author":"Zhang","year":"2023","journal-title":"J. Franklin Inst."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0305054825001509?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0305054825001509?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:22:41Z","timestamp":1762291361000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054825001509"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":43,"alternative-id":["S0305054825001509"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.cor.2025.107122","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[2025,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Novel valid inequalities and branch-and-price for Stackelberg security games","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.cor.2025.107122","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107122"}}