A dynamic reformulation heuristic for Generalized Interdiction Problems
•We propose a generalization of standard interdiction problems.•We describe a single-level (heuristic) mixed-integer linear programming reformulation.•We propose an effective heuristic based on a dynamic improvement of the reformulation.•We compare alternative heuristics on a large testbed of 1200+...
Saved in:
| Published in: | European journal of operational research Vol. 267; no. 1; pp. 40 - 51 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
16.05.2018
Elsevier |
| Subjects: | |
| ISSN: | 0377-2217, 1872-6860 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | •We propose a generalization of standard interdiction problems.•We describe a single-level (heuristic) mixed-integer linear programming reformulation.•We propose an effective heuristic based on a dynamic improvement of the reformulation.•We compare alternative heuristics on a large testbed of 1200+ instances.
We consider a subfamily of mixed-integer linear bilevel problems that we call Generalized Interdiction Problems. This class of problems includes, among others, the widely-studied interdiction problems, i.e., zero-sum Stackelberg games where two players (called the leader and the follower) share a set of items, and the leader can interdict the usage of certain items by the follower. Problems of this type can be modeled as Mixed-Integer Nonlinear Programming problems, whose exact solution can be very hard. In this paper we propose a new heuristic scheme based on a single-level and compact mixed-integer linear programming reformulation of the problem obtained by relaxing the integrality of the follower variables. A distinguished feature of our method is that general-purpose mixed-integer cutting planes for the follower problem are exploited, on the fly, to dynamically improve the reformulation. The resulting heuristic algorithm proved very effective on a large number of test instances, often providing an (almost) optimal solution within very short computing times. |
|---|---|
| AbstractList | •We propose a generalization of standard interdiction problems.•We describe a single-level (heuristic) mixed-integer linear programming reformulation.•We propose an effective heuristic based on a dynamic improvement of the reformulation.•We compare alternative heuristics on a large testbed of 1200+ instances.
We consider a subfamily of mixed-integer linear bilevel problems that we call Generalized Interdiction Problems. This class of problems includes, among others, the widely-studied interdiction problems, i.e., zero-sum Stackelberg games where two players (called the leader and the follower) share a set of items, and the leader can interdict the usage of certain items by the follower. Problems of this type can be modeled as Mixed-Integer Nonlinear Programming problems, whose exact solution can be very hard. In this paper we propose a new heuristic scheme based on a single-level and compact mixed-integer linear programming reformulation of the problem obtained by relaxing the integrality of the follower variables. A distinguished feature of our method is that general-purpose mixed-integer cutting planes for the follower problem are exploited, on the fly, to dynamically improve the reformulation. The resulting heuristic algorithm proved very effective on a large number of test instances, often providing an (almost) optimal solution within very short computing times. We consider a subfamily of mixed-integer linear bilevel problems that we call Generalized Interdiction Problems. This class of problems includes, among others, the widely-studied interdiction problems, i.e., zero-sum Stackelberg games where two players (called the leader and the follower) share a set of items, and the leader can interdict the usage of certain items by the follower. Problems of this type can be modeled as Mixed-Integer Nonlinear Programming problems, whose exact solution can be very hard. In this paper we propose a new heuristic scheme based on a single-level and compact mixed-integer linear programming reformulation of the problem obtained by relaxing the integrality of the follower variables. A distinguished feature of our method is that general-purpose mixed-integer cutting planes for the follower problem are exploited, on the fly, to dynamically improve the reformulation. The resulting heuristic algorithm proved very effective on a large number of test instances, often providing an (almost) optimal solution within very short computing times. |
| Author | Monaci, Michele Sinnl, Markus Fischetti, Matteo |
| Author_xml | – sequence: 1 givenname: Matteo orcidid: 0000-0001-6601-0568 surname: Fischetti fullname: Fischetti, Matteo email: matteo.fischetti@unipd.it organization: Department of Information Engineering, University of Padua, Padua, Italy – sequence: 2 givenname: Michele surname: Monaci fullname: Monaci, Michele email: michele.monaci@unibo.it organization: DEI “Guglielmo Marconi”, University of Bologna, Bologna, Italy – sequence: 3 givenname: Markus orcidid: 0000-0003-1439-8702 surname: Sinnl fullname: Sinnl, Markus email: markus.sinnl@univie.ac.at organization: Department of Statistics and Operations Research, University of Vienna, Vienna, Austria |
| BackLink | https://inria.hal.science/hal-01666298$$DView record in HAL |
| BookMark | eNp9kM9LwzAYhoNMcE7_AU-9emjNl7ZJC17G0G0w0IOeQ5Z8ZSn9IUk3mH-96SYePOz0wcv7vPA9t2TS9R0S8gA0AQr8qU6w7l3CKIgEIKFZekWmUAgW84LTCZnSVIiYMRA35Nb7mlIKOeRTspxH5tip1urIYdW7dt-owfZdtMO9s34IeUijJXboVGO_0UTrbkBnrD7V3l2_bbD1d-S6Uo3H-987I5-vLx-LVbx5W64X802sM6BDrHRW6jSnTKc6Z2lWZbwC2PKcihJLzEohsq0usBIsr5ApJUoDpTaCC9CFSdMZeTzv7lQjv5xtlTvKXlm5mm_kmAUbnLOyOEDosnNXu9778N4fAFSO2mQtR21y1CYBZNAWoOIfpO1wUjI4ZZvL6PMZxSDgYNFJry12Go11qAdpensJ_wHpoIrf |
| CitedBy_id | crossref_primary_10_1007_s10107_020_01482_5 crossref_primary_10_1016_j_seps_2023_101521 crossref_primary_10_1016_j_jcss_2022_02_004 crossref_primary_10_1287_ijoc_2023_0239 crossref_primary_10_1016_j_cie_2021_107873 crossref_primary_10_1016_j_ejco_2021_100020 crossref_primary_10_1016_j_cie_2020_106708 crossref_primary_10_1007_s12532_023_00244_6 crossref_primary_10_1007_s10107_024_02133_9 crossref_primary_10_1016_j_cie_2021_107708 crossref_primary_10_1007_s10107_020_01601_2 crossref_primary_10_4018_IJAMC_387961 crossref_primary_10_1287_ijoc_2024_0686 crossref_primary_10_1287_ijoc_2019_0945 crossref_primary_10_1287_ijoc_2020_1041 crossref_primary_10_1007_s10287_023_00435_5 crossref_primary_10_1016_j_ejor_2020_09_007 crossref_primary_10_1007_s12190_025_02549_2 crossref_primary_10_1016_j_ejor_2019_05_012 crossref_primary_10_1007_s11590_020_01660_6 crossref_primary_10_1287_ijoo_2021_0068 crossref_primary_10_1016_j_ejor_2021_01_030 |
| Cites_doi | 10.1007/s10957-010-9668-3 10.1080/07408170600729192 10.1287/mnsc.45.3.414 10.1287/opre.43.2.243 10.1016/j.dam.2011.06.023 10.1007/s10898-015-0274-7 10.1287/ijoc.2015.0676 10.1016/j.cor.2012.02.023 10.1007/BF00121266 10.1007/s10732-005-3122-y 10.1287/ijoc.1060.0189 10.1287/opre.2017.1650 10.1137/0913069 10.1007/BF02592196 10.1007/BF01584329 10.1287/ijoc.2014.0632 10.1287/inte.1060.0252 10.1016/0377-2217(94)00215-0 10.1080/07408170500488956 10.1007/s101070100263 10.1287/opre.38.5.911 10.1007/BF00121269 10.1016/j.cor.2016.12.010 10.1007/s11590-006-0024-3 10.1002/net.10039 10.1007/BF01416737 10.1287/opre.1080.0643 10.1007/s10107-013-0700-x 10.1137/130906593 10.1080/02331938708843247 10.1016/0895-7177(93)90236-R 10.1016/j.ejor.2007.03.034 |
| ContentType | Journal Article |
| Copyright | 2017 Elsevier B.V. Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: 2017 Elsevier B.V. – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION 1XC |
| DOI | 10.1016/j.ejor.2017.11.043 |
| DatabaseName | CrossRef Hyper Article en Ligne (HAL) |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 51 |
| ExternalDocumentID | oai:HAL:hal-01666298v1 10_1016_j_ejor_2017_11_043 S0377221717310548 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD 1XC |
| ID | FETCH-LOGICAL-c410t-ac49c3502c3c5234f46f11b65079e9e49774bc8ef725fe2aa79d19cd7671c8d33 |
| ISICitedReferencesCount | 22 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000424722300004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Tue Oct 14 20:25:15 EDT 2025 Tue Nov 18 20:44:32 EST 2025 Sat Nov 29 05:34:33 EST 2025 Fri Feb 23 02:27:37 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Bilevel optimization (O) Combinatorial optimization Interdiction problems Mixed-integer programming Heuristics |
| Language | English |
| License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c410t-ac49c3502c3c5234f46f11b65079e9e49774bc8ef725fe2aa79d19cd7671c8d33 |
| ORCID | 0000-0001-6601-0568 0000-0003-1439-8702 |
| OpenAccessLink | https://www.sciencedirect.com/science/article/pii/S0377221717310548 |
| PageCount | 12 |
| ParticipantIDs | hal_primary_oai_HAL_hal_01666298v1 crossref_primary_10_1016_j_ejor_2017_11_043 crossref_citationtrail_10_1016_j_ejor_2017_11_043 elsevier_sciencedirect_doi_10_1016_j_ejor_2017_11_043 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-05-16 |
| PublicationDateYYYYMMDD | 2018-05-16 |
| PublicationDate_xml | – month: 05 year: 2018 text: 2018-05-16 day: 16 |
| PublicationDecade | 2010 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2018 |
| Publisher | Elsevier B.V Elsevier |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier |
| References | Gendreau, Marcotte, Savard (bib0022) 1996; 8 Brown, Carlyle, Salmeron, Wood (bib0008) 2005 Lodi, A., Ralphs, T., Rossi, F., & Smriglio, S. (2011). Interdiction branching. Technical Report, COR@L Laboratory, Lehigh University. Lodi, Ralphs, Woeginger (bib0031) 2014; 146 Von Stackelberg (bib0041) 1952 Köppe, Queyranne, Ryan (bib0028) 2010; 146 Bazgan, Toubaline, Tuza (bib0005) 2011; 159 Calvete, Gal, Mateo (bib0010) 2008; 188 Caprara, Carvalho, Lodi, Woeginger (bib0012) 2014; 24 Assunção, Noronha, Santos, Andrade (bib0001) 2017; 81 Caprara, Carvalho, Lodi, Woeginger (bib0011) 2016; 28 Rothberg (bib0038) 2007; 19 Wood (bib0045) 1993; 17 Brown, Carlyle, Salmeron, Wood (bib0009) 2006; 36 Talbi (bib0039) 2013; 482 Brown, Carlyle, Harney, Skroch, Wood (bib0007) 2009; 57 Loridan, Morgan (bib0032) 1996; 8 Fischetti, Ljubić, Monaci, Sinnl (bib0018) 2016 Israeli (bib0025) 1999 Fulkerson, Harding (bib0020) 1977; 13 Dolan, Moré (bib0016) 2002; 91 Morton, Pan, Saeger (bib0035) 2007; 39 Bazgan, Toubaline, Vanderpooten (bib0006) 2012; 39 Tang, Richard, Smith (bib0040) 2016; 66 Martello, Pisinger, Toth (bib0033) 1999; 45 Dempe (bib0014) 1987; 18 Ralphs, T. K., & Adams, E. (2016). Bilevel instance library. Wen, Huang (bib0043) 1996; 88 Furini, Iori, Martello, Yagiura (bib0021) 2015; 27 Wood (bib0044) 2010 Caprara, Fischetti (bib0013) 1996; 74 Held, Woodruff (bib0024) 2005; 11 . Outrata (bib0036) 1990; 34 Fischetti, Ljubić, Monaci, Sinnl (bib0019) 2017; 65 Baggio, A., Carvalho, M., Lodi, A., & Tramontani, A. (2016). Multilevel approaches for the critical node problem. Working paper, École Polytechnique de Montréal. Fischetti, M., Ljubić, I., Monaci, M., & Sinnl, M. (2016a). Interdiction games and monotonicity, with application to knapsack problems. Technical report, DEI, University of Padova. DeNegre (bib0015) 2011 Israeli, Wood (bib0026) 2002; 40 Khuri, S., Baeck, T., & Heitkoetter, J. (1994). SAC94 suite: Collection of multiple knapsack problems. Hansen, Jaumard, Savard (bib0023) 1992; 13 Moore, Bard (bib0034) 1990; 38 Audet, Haddad, Savard (bib0002) 2007; 1 Baggio (bib0003) 2016 Lim, Smith (bib0029) 2007; 39 Washburn, Wood (bib0042) 1995; 43 Dempe (10.1016/j.ejor.2017.11.043_bib0014) 1987; 18 Israeli (10.1016/j.ejor.2017.11.043_bib0025) 1999 Calvete (10.1016/j.ejor.2017.11.043_bib0010) 2008; 188 Rothberg (10.1016/j.ejor.2017.11.043_bib0038) 2007; 19 DeNegre (10.1016/j.ejor.2017.11.043_bib0015) 2011 Wen (10.1016/j.ejor.2017.11.043_bib0043) 1996; 88 Brown (10.1016/j.ejor.2017.11.043_bib0007) 2009; 57 Fischetti (10.1016/j.ejor.2017.11.043_bib0019) 2017; 65 Martello (10.1016/j.ejor.2017.11.043_bib0033) 1999; 45 Washburn (10.1016/j.ejor.2017.11.043_bib0042) 1995; 43 10.1016/j.ejor.2017.11.043_bib0017 Held (10.1016/j.ejor.2017.11.043_bib0024) 2005; 11 Israeli (10.1016/j.ejor.2017.11.043_bib0026) 2002; 40 10.1016/j.ejor.2017.11.043_bib0037 Fischetti (10.1016/j.ejor.2017.11.043_bib0018) 2016 Lodi (10.1016/j.ejor.2017.11.043_bib0031) 2014; 146 Caprara (10.1016/j.ejor.2017.11.043_bib0013) 1996; 74 Morton (10.1016/j.ejor.2017.11.043_bib0035) 2007; 39 Loridan (10.1016/j.ejor.2017.11.043_bib0032) 1996; 8 Moore (10.1016/j.ejor.2017.11.043_bib0034) 1990; 38 Assunção (10.1016/j.ejor.2017.11.043_bib0001) 2017; 81 Gendreau (10.1016/j.ejor.2017.11.043_bib0022) 1996; 8 Wood (10.1016/j.ejor.2017.11.043_bib0045) 1993; 17 Von Stackelberg (10.1016/j.ejor.2017.11.043_bib0041) 1952 Brown (10.1016/j.ejor.2017.11.043_bib0008) 2005 Bazgan (10.1016/j.ejor.2017.11.043_bib0005) 2011; 159 Outrata (10.1016/j.ejor.2017.11.043_bib0036) 1990; 34 Talbi (10.1016/j.ejor.2017.11.043_bib0039) 2013; 482 Brown (10.1016/j.ejor.2017.11.043_bib0009) 2006; 36 10.1016/j.ejor.2017.11.043_bib0027 Lim (10.1016/j.ejor.2017.11.043_bib0029) 2007; 39 10.1016/j.ejor.2017.11.043_bib0004 Dolan (10.1016/j.ejor.2017.11.043_bib0016) 2002; 91 Caprara (10.1016/j.ejor.2017.11.043_bib0012) 2014; 24 10.1016/j.ejor.2017.11.043_bib0030 Wood (10.1016/j.ejor.2017.11.043_bib0044) 2010 Furini (10.1016/j.ejor.2017.11.043_bib0021) 2015; 27 Fulkerson (10.1016/j.ejor.2017.11.043_bib0020) 1977; 13 Hansen (10.1016/j.ejor.2017.11.043_bib0023) 1992; 13 Köppe (10.1016/j.ejor.2017.11.043_bib0028) 2010; 146 Baggio (10.1016/j.ejor.2017.11.043_bib0003) 2016 Audet (10.1016/j.ejor.2017.11.043_bib0002) 2007; 1 Tang (10.1016/j.ejor.2017.11.043_bib0040) 2016; 66 Bazgan (10.1016/j.ejor.2017.11.043_bib0006) 2012; 39 Caprara (10.1016/j.ejor.2017.11.043_bib0011) 2016; 28 |
| References_xml | – volume: 91 start-page: 201 year: 2002 end-page: 213 ident: bib0016 article-title: Benchmarking optimization software with performance profiles publication-title: Mathematical Programming – volume: 188 start-page: 14 year: 2008 end-page: 28 ident: bib0010 article-title: A new approach for solving linear bilevel problems using genetic algorithms publication-title: European Journal of Operational Research – volume: 19 start-page: 534 year: 2007 end-page: 541 ident: bib0038 article-title: An evolutionary algorithm for polishing mixed integer programming solutions publication-title: INFORMS Journal on Computing – volume: 34 start-page: 255 year: 1990 end-page: 277 ident: bib0036 article-title: On the numerical solution of a class of Stackelberg problems publication-title: ZOR—Methods and Models of Operations Research – volume: 146 start-page: 137 year: 2010 end-page: 150 ident: bib0028 article-title: Parametric integer programming algorithm for bilevel mixed integer programs publication-title: Journal of Optimization Theory and Applications – year: 1952 ident: bib0041 publication-title: The theory of the market economy – volume: 1 start-page: 259 year: 2007 end-page: 267 ident: bib0002 article-title: Disjunctive cuts for continuous linear bilevel programming publication-title: Optimization Letters – volume: 57 start-page: 866 year: 2009 end-page: 877 ident: bib0007 article-title: Interdicting a nuclear-weapons project publication-title: Operations Research – volume: 8 start-page: 217 year: 1996 end-page: 233 ident: bib0022 article-title: A hybrid tabu-ascent algorithm for the linear bilevel programming problem publication-title: Journal of Global Optimization – year: 2016 ident: bib0003 publication-title: Towards optimal approximations for firefighting and related problems – volume: 13 start-page: 1194 year: 1992 end-page: 1217 ident: bib0023 article-title: New branch-and-bound rules for linear bilevel programming publication-title: SIAM Journal on Scientific and Statistical Computing – year: 2011 ident: bib0015 publication-title: Interdiction and discrete bilevel linear programming – year: 1999 ident: bib0025 publication-title: System interdiction and defense – volume: 74 start-page: 221 year: 1996 end-page: 235 ident: bib0013 article-title: {0, 1/2}-Chvátal–Gomory cuts publication-title: Mathematical Programming – start-page: 102 year: 2005 end-page: 123 ident: bib0008 article-title: Analyzing the vulnerability of critical infrastructure to attack and planning defenses publication-title: Tutorials in operations research: Emerging theory, methods, and applications – volume: 81 start-page: 51 year: 2017 end-page: 66 ident: bib0001 article-title: A linear programming based heuristic framework for min–max regret combinatorial optimization problems with interval costs publication-title: Computers & Operations Research – start-page: 77 year: 2016 end-page: 88 ident: bib0018 article-title: Intersection cuts for bilevel optimization publication-title: Integer programming and combinatorial optimization: 18th international conference, IPCO 2016, Liège, Belgium, June 1–3, 2016, Proceedings – volume: 13 start-page: 116 year: 1977 end-page: 118 ident: bib0020 article-title: Maximizing the minimum source-sink path subject to a budget constraint publication-title: Mathematical Programming – volume: 45 start-page: 414 year: 1999 end-page: 424 ident: bib0033 article-title: Dynamic programming and strong bounds for the 0–1 knapsack problem publication-title: Management Science – volume: 18 start-page: 373 year: 1987 end-page: 385 ident: bib0014 article-title: A simple algorithm for the linear bilevel programming problem publication-title: Optimization – volume: 17 start-page: 1 year: 1993 end-page: 18 ident: bib0045 article-title: Deterministic network interdiction publication-title: Mathematical and Computer Modelling – volume: 39 start-page: 3 year: 2007 end-page: 14 ident: bib0035 article-title: Models for nuclear smuggling interdiction publication-title: IIE Transactions – volume: 24 start-page: 823 year: 2014 end-page: 838 ident: bib0012 article-title: A study on the computational complexity of the bilevel knapsack problem publication-title: SIAM Journal on Optimization – volume: 43 start-page: 243 year: 1995 end-page: 251 ident: bib0042 article-title: Two-person zero-sum games for network interdiction publication-title: Operations Research – volume: 8 start-page: 263 year: 1996 end-page: 297 ident: bib0032 article-title: Weak via strong Stackelberg problem: New results publication-title: Journal of Global Optimization – volume: 39 start-page: 2888 year: 2012 end-page: 2898 ident: bib0006 article-title: Efficient determination of the k most vital edges for the minimum spanning tree problem publication-title: Computers & Operations Research – volume: 40 start-page: 97 year: 2002 end-page: 111 ident: bib0026 article-title: Shortest-path network interdiction publication-title: Networks – reference: Lodi, A., Ralphs, T., Rossi, F., & Smriglio, S. (2011). Interdiction branching. Technical Report, COR@L Laboratory, Lehigh University. – volume: 39 start-page: 15 year: 2007 end-page: 26 ident: bib0029 article-title: Algorithms for discrete and continuous multicommodity flow network interdiction problems publication-title: IIE Transactions – volume: 38 start-page: 911 year: 1990 end-page: 921 ident: bib0034 article-title: The mixed integer linear bilevel programming problem publication-title: Operations Research – volume: 88 start-page: 563 year: 1996 end-page: 571 ident: bib0043 article-title: A simple tabu search method to solve the mixed-integer linear bilevel programming problem publication-title: European Journal of Operational Research – volume: 159 start-page: 1933 year: 2011 end-page: 1946 ident: bib0005 article-title: The most vital nodes with respect to independent set and vertex cover publication-title: Discrete Applied Mathematics – volume: 65 start-page: 1615 year: 2017 end-page: 1637 ident: bib0019 article-title: A new general-purpose algorithm for mixed-integer bilevel linear programs publication-title: Operations Research – reference: . – volume: 36 start-page: 530 year: 2006 end-page: 544 ident: bib0009 article-title: Defending critical infrastructure publication-title: Interfaces – volume: 28 start-page: 319 year: 2016 end-page: 333 ident: bib0011 article-title: Bilevel knapsack with interdiction constraints publication-title: INFORMS Journal on Computing – volume: 11 start-page: 483 year: 2005 end-page: 500 ident: bib0024 article-title: Heuristics for multi-stage interdiction of stochastic networks publication-title: Journal of Heuristics – reference: Khuri, S., Baeck, T., & Heitkoetter, J. (1994). SAC94 suite: Collection of multiple knapsack problems. – volume: 146 start-page: 437 year: 2014 end-page: 458 ident: bib0031 article-title: Bilevel programming and the separation problem publication-title: Mathematical Programming – reference: Ralphs, T. K., & Adams, E. (2016). Bilevel instance library. – reference: Fischetti, M., Ljubić, I., Monaci, M., & Sinnl, M. (2016a). Interdiction games and monotonicity, with application to knapsack problems. Technical report, DEI, University of Padova. – volume: 27 start-page: 392 year: 2015 end-page: 405 ident: bib0021 article-title: Heuristic and exact algorithms for the interval min–max regret knapsack problem publication-title: INFORMS Journal on Computing – reference: Baggio, A., Carvalho, M., Lodi, A., & Tramontani, A. (2016). Multilevel approaches for the critical node problem. Working paper, École Polytechnique de Montréal. – volume: 482 year: 2013 ident: bib0039 publication-title: Metaheuristics for bi-level optimization – volume: 66 start-page: 225 year: 2016 end-page: 262 ident: bib0040 article-title: A class of algorithms for mixed-integer bilevel min–max optimization publication-title: Journal of Global Optimization – year: 2010 ident: bib0044 article-title: Bilevel network interdiction models: Formulations and solutions publication-title: Wiley encyclopedia of operations research and management science – volume: 146 start-page: 137 issue: 1 year: 2010 ident: 10.1016/j.ejor.2017.11.043_bib0028 article-title: Parametric integer programming algorithm for bilevel mixed integer programs publication-title: Journal of Optimization Theory and Applications doi: 10.1007/s10957-010-9668-3 – volume: 39 start-page: 15 issue: 1 year: 2007 ident: 10.1016/j.ejor.2017.11.043_bib0029 article-title: Algorithms for discrete and continuous multicommodity flow network interdiction problems publication-title: IIE Transactions doi: 10.1080/07408170600729192 – volume: 45 start-page: 414 issue: 3 year: 1999 ident: 10.1016/j.ejor.2017.11.043_bib0033 article-title: Dynamic programming and strong bounds for the 0–1 knapsack problem publication-title: Management Science doi: 10.1287/mnsc.45.3.414 – volume: 43 start-page: 243 issue: 2 year: 1995 ident: 10.1016/j.ejor.2017.11.043_bib0042 article-title: Two-person zero-sum games for network interdiction publication-title: Operations Research doi: 10.1287/opre.43.2.243 – volume: 159 start-page: 1933 issue: 17 year: 2011 ident: 10.1016/j.ejor.2017.11.043_bib0005 article-title: The most vital nodes with respect to independent set and vertex cover publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2011.06.023 – volume: 66 start-page: 225 issue: 2 year: 2016 ident: 10.1016/j.ejor.2017.11.043_bib0040 article-title: A class of algorithms for mixed-integer bilevel min–max optimization publication-title: Journal of Global Optimization doi: 10.1007/s10898-015-0274-7 – volume: 28 start-page: 319 issue: 2 year: 2016 ident: 10.1016/j.ejor.2017.11.043_bib0011 article-title: Bilevel knapsack with interdiction constraints publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.2015.0676 – volume: 39 start-page: 2888 issue: 11 year: 2012 ident: 10.1016/j.ejor.2017.11.043_bib0006 article-title: Efficient determination of the k most vital edges for the minimum spanning tree problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2012.02.023 – volume: 8 start-page: 217 issue: 3 year: 1996 ident: 10.1016/j.ejor.2017.11.043_bib0022 article-title: A hybrid tabu-ascent algorithm for the linear bilevel programming problem publication-title: Journal of Global Optimization doi: 10.1007/BF00121266 – volume: 11 start-page: 483 year: 2005 ident: 10.1016/j.ejor.2017.11.043_bib0024 article-title: Heuristics for multi-stage interdiction of stochastic networks publication-title: Journal of Heuristics doi: 10.1007/s10732-005-3122-y – volume: 19 start-page: 534 issue: 4 year: 2007 ident: 10.1016/j.ejor.2017.11.043_bib0038 article-title: An evolutionary algorithm for polishing mixed integer programming solutions publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.1060.0189 – volume: 65 start-page: 1615 issue: 6 year: 2017 ident: 10.1016/j.ejor.2017.11.043_bib0019 article-title: A new general-purpose algorithm for mixed-integer bilevel linear programs publication-title: Operations Research doi: 10.1287/opre.2017.1650 – volume: 13 start-page: 1194 year: 1992 ident: 10.1016/j.ejor.2017.11.043_bib0023 article-title: New branch-and-bound rules for linear bilevel programming publication-title: SIAM Journal on Scientific and Statistical Computing doi: 10.1137/0913069 – volume: 74 start-page: 221 issue: 3 year: 1996 ident: 10.1016/j.ejor.2017.11.043_bib0013 article-title: {0, 1/2}-Chvátal–Gomory cuts publication-title: Mathematical Programming doi: 10.1007/BF02592196 – volume: 13 start-page: 116 issue: 1 year: 1977 ident: 10.1016/j.ejor.2017.11.043_bib0020 article-title: Maximizing the minimum source-sink path subject to a budget constraint publication-title: Mathematical Programming doi: 10.1007/BF01584329 – volume: 27 start-page: 392 issue: 2 year: 2015 ident: 10.1016/j.ejor.2017.11.043_bib0021 article-title: Heuristic and exact algorithms for the interval min–max regret knapsack problem publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.2014.0632 – ident: 10.1016/j.ejor.2017.11.043_bib0030 – volume: 36 start-page: 530 issue: 6 year: 2006 ident: 10.1016/j.ejor.2017.11.043_bib0009 article-title: Defending critical infrastructure publication-title: Interfaces doi: 10.1287/inte.1060.0252 – ident: 10.1016/j.ejor.2017.11.043_bib0017 – volume: 88 start-page: 563 issue: 3 year: 1996 ident: 10.1016/j.ejor.2017.11.043_bib0043 article-title: A simple tabu search method to solve the mixed-integer linear bilevel programming problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)00215-0 – volume: 39 start-page: 3 issue: 1 year: 2007 ident: 10.1016/j.ejor.2017.11.043_bib0035 article-title: Models for nuclear smuggling interdiction publication-title: IIE Transactions doi: 10.1080/07408170500488956 – start-page: 77 year: 2016 ident: 10.1016/j.ejor.2017.11.043_bib0018 article-title: Intersection cuts for bilevel optimization – volume: 91 start-page: 201 issue: 2 year: 2002 ident: 10.1016/j.ejor.2017.11.043_bib0016 article-title: Benchmarking optimization software with performance profiles publication-title: Mathematical Programming doi: 10.1007/s101070100263 – volume: 482 year: 2013 ident: 10.1016/j.ejor.2017.11.043_bib0039 – volume: 38 start-page: 911 issue: 5 year: 1990 ident: 10.1016/j.ejor.2017.11.043_bib0034 article-title: The mixed integer linear bilevel programming problem publication-title: Operations Research doi: 10.1287/opre.38.5.911 – year: 1999 ident: 10.1016/j.ejor.2017.11.043_bib0025 – volume: 8 start-page: 263 year: 1996 ident: 10.1016/j.ejor.2017.11.043_bib0032 article-title: Weak via strong Stackelberg problem: New results publication-title: Journal of Global Optimization doi: 10.1007/BF00121269 – volume: 81 start-page: 51 year: 2017 ident: 10.1016/j.ejor.2017.11.043_bib0001 article-title: A linear programming based heuristic framework for min–max regret combinatorial optimization problems with interval costs publication-title: Computers & Operations Research doi: 10.1016/j.cor.2016.12.010 – ident: 10.1016/j.ejor.2017.11.043_bib0027 – volume: 1 start-page: 259 issue: 3 year: 2007 ident: 10.1016/j.ejor.2017.11.043_bib0002 article-title: Disjunctive cuts for continuous linear bilevel programming publication-title: Optimization Letters doi: 10.1007/s11590-006-0024-3 – year: 1952 ident: 10.1016/j.ejor.2017.11.043_bib0041 – volume: 40 start-page: 97 issue: 2 year: 2002 ident: 10.1016/j.ejor.2017.11.043_bib0026 article-title: Shortest-path network interdiction publication-title: Networks doi: 10.1002/net.10039 – year: 2016 ident: 10.1016/j.ejor.2017.11.043_bib0003 – volume: 34 start-page: 255 year: 1990 ident: 10.1016/j.ejor.2017.11.043_bib0036 article-title: On the numerical solution of a class of Stackelberg problems publication-title: ZOR—Methods and Models of Operations Research doi: 10.1007/BF01416737 – volume: 57 start-page: 866 issue: 4 year: 2009 ident: 10.1016/j.ejor.2017.11.043_bib0007 article-title: Interdicting a nuclear-weapons project publication-title: Operations Research doi: 10.1287/opre.1080.0643 – start-page: 102 year: 2005 ident: 10.1016/j.ejor.2017.11.043_bib0008 article-title: Analyzing the vulnerability of critical infrastructure to attack and planning defenses – ident: 10.1016/j.ejor.2017.11.043_bib0037 – volume: 146 start-page: 437 issue: 1–2 year: 2014 ident: 10.1016/j.ejor.2017.11.043_bib0031 article-title: Bilevel programming and the separation problem publication-title: Mathematical Programming doi: 10.1007/s10107-013-0700-x – ident: 10.1016/j.ejor.2017.11.043_bib0004 – volume: 24 start-page: 823 issue: 2 year: 2014 ident: 10.1016/j.ejor.2017.11.043_bib0012 article-title: A study on the computational complexity of the bilevel knapsack problem publication-title: SIAM Journal on Optimization doi: 10.1137/130906593 – volume: 18 start-page: 373 year: 1987 ident: 10.1016/j.ejor.2017.11.043_bib0014 article-title: A simple algorithm for the linear bilevel programming problem publication-title: Optimization doi: 10.1080/02331938708843247 – year: 2011 ident: 10.1016/j.ejor.2017.11.043_bib0015 – volume: 17 start-page: 1 issue: 2 year: 1993 ident: 10.1016/j.ejor.2017.11.043_bib0045 article-title: Deterministic network interdiction publication-title: Mathematical and Computer Modelling doi: 10.1016/0895-7177(93)90236-R – year: 2010 ident: 10.1016/j.ejor.2017.11.043_bib0044 article-title: Bilevel network interdiction models: Formulations and solutions – volume: 188 start-page: 14 issue: 1 year: 2008 ident: 10.1016/j.ejor.2017.11.043_bib0010 article-title: A new approach for solving linear bilevel problems using genetic algorithms publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2007.03.034 |
| SSID | ssj0001515 |
| Score | 2.4032621 |
| Snippet | •We propose a generalization of standard interdiction problems.•We describe a single-level (heuristic) mixed-integer linear programming reformulation.•We... We consider a subfamily of mixed-integer linear bilevel problems that we call Generalized Interdiction Problems. This class of problems includes, among others,... |
| SourceID | hal crossref elsevier |
| SourceType | Open Access Repository Enrichment Source Index Database Publisher |
| StartPage | 40 |
| SubjectTerms | (O) Combinatorial optimization Bilevel optimization Computer Science Heuristics Interdiction problems Mixed-integer programming Operations Research |
| Title | A dynamic reformulation heuristic for Generalized Interdiction Problems |
| URI | https://dx.doi.org/10.1016/j.ejor.2017.11.043 https://inria.hal.science/hal-01666298 |
| Volume | 267 |
| WOSCitedRecordID | wos000424722300004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3da9swEBdpO8b2sI-so90XZuwtOESSnbMezWjXjVIK7SBvxpEl5hCckqah9Gl_-k45yUtaWrbBXowRlj9059PvTrrfMfYpycYlWCtjARrixMrSre_K2A7R67E4hUmzqlpyDCcn2WikTjudnyEXZjmFpsmur9XFfxU1tqGwXersX4i7vSk24DkKHY8odjz-keDzXkVV5ns4-SEi9fW5EBJeESvzamehp5uub0xFUcGqpqLhp1Rh5vLekL2Hr9gwD4FEzxjURpYPa_SZzYJ2CriK4mbWChY76Dps2DfTVq_O6qaZhuyhzWgEz9xCOiVLUojsTpoMpWYBxEJQkmbfkKXNQMTDjIoJBFMsqDTHhs6RYSVOJz9FE0XtHeNPcYhJ30xmjumVQ9_xsxIL1C1S7TP3Su6NOCC-Ra9ti-0ISBWa9p3868HoWzubO8C3Wonyn-ATr2iP4O0n3Qdutn6EMP0Ktpy_YM-8vxHlpCcvWcc0XfY4pDt02fNQ1iPyVr7Lnq5xVL5iX_LI61O0oU9Rq08RtkZr-hSt61MU9GmXfT88OP98FPvqG7FO-GARlzpRWqYDoaXG_zaxydByPkZED8ookzjHYawzY0Gk1oiyBFVxpSsYAtdZJeVrtt3MGrPHIoU42I5laSpjExiDEqVJQcgyAVtxGOwzHoat0J6a3lVImRZhD-KkcENduKFGn7XAod5nvbbPBRGzPHh1GqRReGhJkLFA5Xmw30cUXfsAx8V-lB8Xrm3gFtyFypb8zT_e_C178vsXese2F_Mr85490stFfTn_4BXxF3MTqwE |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+dynamic+reformulation+heuristic+for+Generalized+Interdiction+Problems&rft.jtitle=European+journal+of+operational+research&rft.au=Fischetti%2C+Matteo&rft.au=Monaci%2C+Michele&rft.au=Sinnl%2C+Markus&rft.date=2018-05-16&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=267&rft.issue=1&rft.spage=40&rft.epage=51&rft_id=info:doi/10.1016%2Fj.ejor.2017.11.043&rft.externalDocID=S0377221717310548 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |