A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts
•A new efficient combinatorial branch and bound algorithm for solving the KPC is described.•Several bounding procedures based on different relaxations of the problem are described.•Extensive validation with publicly available benchmarks is reported. We study the Knapsack Problem with Conflicts, a ge...
Uložené v:
| Vydané v: | European journal of operational research Ročník 289; číslo 2; s. 435 - 455 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
01.03.2021
|
| Predmet: | |
| ISSN: | 0377-2217, 1872-6860 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | •A new efficient combinatorial branch and bound algorithm for solving the KPC is described.•Several bounding procedures based on different relaxations of the problem are described.•Extensive validation with publicly available benchmarks is reported.
We study the Knapsack Problem with Conflicts, a generalization of the Knapsack Problem in which a set of conflicts specifies pairs of items which cannot be simultaneously selected. In this work, we propose a novel combinatorial branch-and-bound algorithm for this problem based on an n-ary branching scheme. Our algorithm effectively combines different procedures for pruning the branch-and-bound nodes based on different relaxations of the Knapsack Problem with Conflicts. Its main elements of novelty are: (i) the adoption of the branching-and-pruned set branching scheme which, while extensively used in the maximum-clique literature, was never successfully employed for solving the Knapsack Problem with Conflicts; (ii) the adoption of the Multiple-Choice Knapsack Problem for the derivation of upper bounds used for pruning the branch-and-bound tree nodes; and (iii) the design of a new upper bound for the latter problem which can be computed very efficiently. Key to our algorithm is its high pruning potential and the low computational effort that it requires to process each branch-and-bound node. An extensive set of experiments carried out on the benchmark instances typically used in the literature shows that, for edge densities ranging from 0.1 to 0.9, our algorithm is faster by up to two orders of magnitude than the state-of-the-art method and by up to several orders of magnitude than a state-of-the-art mixed-integer linear programming solver. |
|---|---|
| AbstractList | •A new efficient combinatorial branch and bound algorithm for solving the KPC is described.•Several bounding procedures based on different relaxations of the problem are described.•Extensive validation with publicly available benchmarks is reported.
We study the Knapsack Problem with Conflicts, a generalization of the Knapsack Problem in which a set of conflicts specifies pairs of items which cannot be simultaneously selected. In this work, we propose a novel combinatorial branch-and-bound algorithm for this problem based on an n-ary branching scheme. Our algorithm effectively combines different procedures for pruning the branch-and-bound nodes based on different relaxations of the Knapsack Problem with Conflicts. Its main elements of novelty are: (i) the adoption of the branching-and-pruned set branching scheme which, while extensively used in the maximum-clique literature, was never successfully employed for solving the Knapsack Problem with Conflicts; (ii) the adoption of the Multiple-Choice Knapsack Problem for the derivation of upper bounds used for pruning the branch-and-bound tree nodes; and (iii) the design of a new upper bound for the latter problem which can be computed very efficiently. Key to our algorithm is its high pruning potential and the low computational effort that it requires to process each branch-and-bound node. An extensive set of experiments carried out on the benchmark instances typically used in the literature shows that, for edge densities ranging from 0.1 to 0.9, our algorithm is faster by up to two orders of magnitude than the state-of-the-art method and by up to several orders of magnitude than a state-of-the-art mixed-integer linear programming solver. |
| Author | San Segundo, Pablo Coniglio, Stefano Furini, Fabio |
| Author_xml | – sequence: 1 givenname: Stefano surname: Coniglio fullname: Coniglio, Stefano email: s.coniglio@soton.ac.uk organization: School of Mathematical Sciences, University of Southampton, University Road, SO17 1BJ Southampton, United Kingdom – sequence: 2 givenname: Fabio orcidid: 0000-0002-5024-6186 surname: Furini fullname: Furini, Fabio email: f.furini@iasi.cnr.it organization: IASI-CNR, Istituto di Analisi dei Sistemi ed Informatica “A. Ruberti”, via dei Taurini 19, 00185 Roma, Italy – sequence: 3 givenname: Pablo orcidid: 0000-0001-7050-5563 surname: San Segundo fullname: San Segundo, Pablo email: pablo.sansegundo@upm.es organization: Centre for Automation and Robotics, Universidad Politécnica de Madrid, José Gutiérrez Abascal, 2, 28006 Madrid, Spain |
| BookMark | eNp9kMtOwzAQRS0EEm3hB1j5BxLGzsOJxKaqeIlKsAC2luNMqENiV7ah4u9JVVYsurrSXJ2R7pmTU-ssEnLFIGXAyus-xd75lAOHFEQKPDshM1YJnpRVCadkBpkQCedMnJN5CD0AsIIVM_K-pBZ3VLuxMVZF540aaOOV1ZtE2TZp3JdtqRo-piZuRto5T-MG6ZNV26D0J33xrhlwpLuppitnu8HoGC7IWaeGgJd_uSBvd7evq4dk_Xz_uFquE51DHRNsWqiyrOg4tiLTLG-yqhNFUxe6ERlinetSoSpzruuOc2AAtarrYjqLqkXMFoQf_mrvQvDYya03o_I_koHcm5G93JuRezMShJzMTFD1D9ImqmicjV6Z4Th6c0BxGvVt0MugDVqNrfGoo2ydOYb_Am0TglA |
| CitedBy_id | crossref_primary_10_1007_s00453_022_01079_8 crossref_primary_10_1016_j_cie_2024_110713 crossref_primary_10_1016_j_ejor_2023_02_009 crossref_primary_10_1007_s41660_024_00449_9 crossref_primary_10_1016_j_ejor_2025_02_006 crossref_primary_10_3390_math11010129 crossref_primary_10_1016_j_cor_2021_105447 crossref_primary_10_1109_ACCESS_2021_3066622 crossref_primary_10_3390_math13162674 crossref_primary_10_1016_j_ejor_2022_10_028 crossref_primary_10_1051_smdo_2021008 crossref_primary_10_1007_s00291_024_00746_2 crossref_primary_10_1016_j_ejor_2022_04_009 crossref_primary_10_1109_TCSS_2022_3169838 crossref_primary_10_1016_j_cor_2022_106093 crossref_primary_10_1016_j_neunet_2025_107784 crossref_primary_10_3390_math13071097 crossref_primary_10_1109_TGCN_2021_3056235 crossref_primary_10_1016_j_trc_2024_104681 crossref_primary_10_1109_ACCESS_2021_3124792 crossref_primary_10_1287_ijoc_2021_1115 crossref_primary_10_1109_TITS_2022_3165156 crossref_primary_10_1016_j_ejor_2023_04_023 crossref_primary_10_3390_electronics12214547 crossref_primary_10_1007_s00500_024_09948_w crossref_primary_10_1111_itor_13512 crossref_primary_10_3390_s22103946 crossref_primary_10_1016_j_tre_2021_102530 crossref_primary_10_1007_s11590_021_01741_0 crossref_primary_10_1016_j_comnet_2023_109912 crossref_primary_10_1080_01605682_2023_2228339 crossref_primary_10_1016_j_jenvman_2022_114491 crossref_primary_10_1016_j_cor_2021_105692 crossref_primary_10_1287_ijoc_2022_1165 crossref_primary_10_1016_j_cor_2024_106685 crossref_primary_10_1016_j_cor_2024_106620 crossref_primary_10_1109_ACCESS_2022_3180753 crossref_primary_10_1016_j_orl_2021_10_001 crossref_primary_10_3390_a18080526 crossref_primary_10_1007_s10479_024_06025_1 crossref_primary_10_1016_j_cor_2024_106561 crossref_primary_10_1016_j_cie_2023_109585 crossref_primary_10_1016_j_ejor_2021_01_030 crossref_primary_10_1016_j_patrec_2022_04_012 |
| Cites_doi | 10.1016/j.ejor.2019.03.047 10.1007/s10878-009-9264-3 10.1016/j.cie.2011.01.019 10.1007/BF00226291 10.1016/j.ejor.2018.03.020 10.1007/s10107-010-0438-7 10.1016/0377-2217(94)90252-6 10.1007/s12532-019-00167-1 10.1007/s10898-018-0630-5 10.1016/j.disopt.2014.05.001 10.1007/s10107-012-0513-3 10.1007/s10898-006-9039-7 10.1007/s10898-013-0075-9 10.1057/palgrave.jors.2602046 10.1016/j.cor.2019.05.017 10.1287/ijoc.1090.0355 10.1057/jors.1992.71 10.1287/opre.2017.1650 10.1137/140966332 10.1016/j.ejor.2019.02.028 10.1287/ijoc.2016.0742 10.1016/j.cor.2015.06.009 10.1007/s10107-017-1189-5 10.1016/0377-2217(95)00015-I 10.1287/opre.27.3.503 10.1007/BF02591729 10.1007/s12532-012-0042-3 10.1016/j.dam.2017.02.005 10.1016/j.cor.2005.10.004 10.1016/S0167-6377(00)00060-2 10.1007/s11590-011-0431-y 10.1007/s10107-003-0395-5 10.1016/j.cor.2017.02.017 10.1016/S0167-6377(96)00038-7 10.1007/BF02579273 10.1016/j.cor.2013.10.018 10.1016/j.ejor.2014.09.064 10.7155/jgaa.00186 10.1007/BF02392825 10.1007/s10288-005-0071-0 10.1287/ijoc.1120.0499 10.1287/ijoc.1100.0406 10.1080/0305215X.2013.819096 10.1287/mnsc.45.3.414 10.1007/s10107-012-0596-x 10.1016/0377-2217(77)90024-8 10.1504/IJOR.2012.044026 10.1287/ijoc.2017.0770 10.1016/0020-0190(84)90014-0 10.1016/j.cor.2010.07.019 |
| ContentType | Journal Article |
| Copyright | 2020 Elsevier B.V. |
| Copyright_xml | – notice: 2020 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ejor.2020.07.023 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 455 |
| ExternalDocumentID | 10_1016_j_ejor_2020_07_023 S0377221720306342 |
| 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 AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG 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 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 EJD FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c409t-ebd08335f2ed73c14b38f75b95cb73ee94c6aea642c9f2201009a9954c678dee3 |
| ISICitedReferencesCount | 53 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000588034600003&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 Nov 18 22:22:11 EST 2025 Sat Nov 29 07:19:22 EST 2025 Fri Feb 23 02:46:26 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Knapsack Problem with Conflicts Combinatorial optimization Branch-and-bound algorithm Maximum Weighted Clique Problem |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c409t-ebd08335f2ed73c14b38f75b95cb73ee94c6aea642c9f2201009a9954c678dee3 |
| ORCID | 0000-0002-5024-6186 0000-0001-7050-5563 |
| OpenAccessLink | http://hdl.handle.net/11573/1571791 |
| PageCount | 21 |
| ParticipantIDs | crossref_primary_10_1016_j_ejor_2020_07_023 crossref_citationtrail_10_1016_j_ejor_2020_07_023 elsevier_sciencedirect_doi_10_1016_j_ejor_2020_07_023 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-03-01 |
| PublicationDateYYYYMMDD | 2021-03-01 |
| PublicationDate_xml | – month: 03 year: 2021 text: 2021-03-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2021 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Corrêa, Donne, Koch, Marenco (bib0013) 2018; 245 Nemhauser, Sigismondi (bib0047) 1992; 43 Furini, Ljubic, Malaguti, Paronuzzi (bib0023) 2020; 12 San Segundo, Furini, Artieda (bib0054) 2019; 110 Li, Liu, Jiang, Many, Li (bib0040) 2018; 270 Coniglio, Tieves (bib0012) 2015 Fischetti, Ljubic, Monaci, Sinnl (bib0021) 2018; 172 Hifi, Otmani (bib0032) 2012; 13 Pferschy, Schauer (bib0048) 2009; 13 Bolusani, Coniglio, Ralphs, Tahernejad (bib0009) 2020 Karp (bib0036) 1972 Held, Cook, Sewell (bib0028) 2012; 4 San Segundo, Matia, Rodriguez-Losada, Hernando (bib0055) 2013; 7 Zemel (bib0066) 1984; 18 Tomita, Kameda (bib0062) 2007; 37 Grötschel, Lovász, Schrijver (bib0027) 1981; 1 Li, Fang, Jiang, Xu (bib0038) 2018; 30 DeNegre, Ralphs (bib0016) 2009 Dempe (bib0015) 2002 Akeb, Hifi, Mounir (bib0001) 2011; 60 Amaldi, Capone, Coniglio, Gianoli (bib0002) 2013 Furini, Ljubic, Martin, San Segundo (bib0024) 2019; 277 Sinha, Zoltners (bib0061) 1979; 27 Falkenauer (bib0019) 1996; 2 Colson, Marcotte, Savard (bib0011) 2005; 3 Fischetti, Ljubic, Monaci, Sinnl (bib0020) 2017; 65 Pisinger (bib0049) 1995; 83 San Segundo, Nikolaev, Batsyn, Pardalos (bib0057) 2016; 27 Bourjolly, Laporte, Mercure (bib0010) 1997; 20 San Segundo, Nikolaev, Batsyn (bib0056) 2015; 64 Wei, Luo, Baldacci, Lim (bib0063) 2019 Dyer (bib0017) 1984; 29 Jiang, Li, Manyà (bib0035) 2017 Rossi, Smriglio (bib0051) 2001; 28 Bettinelli, Cacchiani, Malaguti (bib0007) 2017; 29 Rebennack, Oswald, Theis, Seitz, Reinelt, Pardalos (bib0050) 2011; 21 San Segundo, Tapia (bib0059) 2014; 44 San Segundo, Coniglio, Furini, Ljubić (bib0053) 2019; 278 Hifi, Michrafy (bib0031) 2007; 34 Amaldi, Coniglio, Gualandi (bib0004) 2014; 143 Fischetti, Lodi (bib0022) 2003; 98 Croce, Tadei (bib0014) 1994; 73 Hifi, Michrafy (bib0030) 2006; 57 Wu, Hao (bib0064) 2015; 242 Martello, Pisinger, Toth (bib0042) 1999; 45 Sadykov, Vanderbeck (bib0052) 2013; 25 Giandomenico, Letchford, Rossi, Smriglio (bib0025) 2015; 25 Shimizu, Yamaguchi, Masuda (bib0060) 2018 Kellerer, Pferschy, Pisinger (bib0037) 2004 Basilico, Coniglio, Gatti, Marchesi (bib0006) 2017 Martello, Toth (bib0043) 1977; 1 Li, Jiang, Manyà (bib0039) 2017; 84 Yamada, Kataoka, Watanabe (bib0065) 2002; 43 Boland, Bley, Fricke, Froyland, Sotirov (bib0008) 2012; 133 Giandomenico, Rossi, Smriglio (bib0026) 2013; 141 San Segundo, Rodríguez-Losada, Jiménez (bib0058) 2011; 38 Hosseinian, Fontes, Butenko (bib0033) 2018; 72 Muritiba, Iori, Malaguti, Toth (bib0046) 2010; 22 Basilico, Coniglio, Gatti (bib0005) 2016 Elhedhli, Li, Gzara, Naoum-Sawaya (bib0018) 2011; 23 Martello, Toth (bib0044) 1990 Hifi (bib0029) 2014; 46 Maslov, Batsyn, Pardalos (bib0045) 2014; 59 Håstad (bib0034) 1999; 182 Amaldi, Coniglio, Gualandi (bib0003) 2010 Louveaux, Mathieu (bib0041) 2014; 13 Rebennack (10.1016/j.ejor.2020.07.023_bib0050) 2011; 21 San Segundo (10.1016/j.ejor.2020.07.023_bib0056) 2015; 64 Li (10.1016/j.ejor.2020.07.023_bib0039) 2017; 84 Boland (10.1016/j.ejor.2020.07.023_bib0008) 2012; 133 Håstad (10.1016/j.ejor.2020.07.023_bib0034) 1999; 182 Muritiba (10.1016/j.ejor.2020.07.023_bib0046) 2010; 22 Grötschel (10.1016/j.ejor.2020.07.023_bib0027) 1981; 1 Hifi (10.1016/j.ejor.2020.07.023_bib0030) 2006; 57 Hosseinian (10.1016/j.ejor.2020.07.023_bib0033) 2018; 72 Martello (10.1016/j.ejor.2020.07.023_bib0043) 1977; 1 San Segundo (10.1016/j.ejor.2020.07.023_bib0055) 2013; 7 DeNegre (10.1016/j.ejor.2020.07.023_bib0016) 2009 San Segundo (10.1016/j.ejor.2020.07.023_bib0054) 2019; 110 San Segundo (10.1016/j.ejor.2020.07.023_bib0058) 2011; 38 San Segundo (10.1016/j.ejor.2020.07.023_bib0053) 2019; 278 Yamada (10.1016/j.ejor.2020.07.023_bib0065) 2002; 43 Furini (10.1016/j.ejor.2020.07.023_bib0024) 2019; 277 Jiang (10.1016/j.ejor.2020.07.023_bib0035) 2017 Dempe (10.1016/j.ejor.2020.07.023_bib0015) 2002 Fischetti (10.1016/j.ejor.2020.07.023_bib0020) 2017; 65 Hifi (10.1016/j.ejor.2020.07.023_bib0031) 2007; 34 Pisinger (10.1016/j.ejor.2020.07.023_bib0049) 1995; 83 Furini (10.1016/j.ejor.2020.07.023_bib0023) 2020; 12 Giandomenico (10.1016/j.ejor.2020.07.023_bib0026) 2013; 141 San Segundo (10.1016/j.ejor.2020.07.023_bib0059) 2014; 44 Amaldi (10.1016/j.ejor.2020.07.023_bib0004) 2014; 143 Maslov (10.1016/j.ejor.2020.07.023_bib0045) 2014; 59 Pferschy (10.1016/j.ejor.2020.07.023_bib0048) 2009; 13 Giandomenico (10.1016/j.ejor.2020.07.023_bib0025) 2015; 25 Hifi (10.1016/j.ejor.2020.07.023_bib0032) 2012; 13 Akeb (10.1016/j.ejor.2020.07.023_bib0001) 2011; 60 Sadykov (10.1016/j.ejor.2020.07.023_bib0052) 2013; 25 Kellerer (10.1016/j.ejor.2020.07.023_bib0037) 2004 Sinha (10.1016/j.ejor.2020.07.023_bib0061) 1979; 27 Held (10.1016/j.ejor.2020.07.023_bib0028) 2012; 4 Corrêa (10.1016/j.ejor.2020.07.023_bib0013) 2018; 245 Amaldi (10.1016/j.ejor.2020.07.023_bib0003) 2010 Hifi (10.1016/j.ejor.2020.07.023_bib0029) 2014; 46 Nemhauser (10.1016/j.ejor.2020.07.023_bib0047) 1992; 43 Croce (10.1016/j.ejor.2020.07.023_bib0014) 1994; 73 Li (10.1016/j.ejor.2020.07.023_bib0038) 2018; 30 Amaldi (10.1016/j.ejor.2020.07.023_bib0002) 2013 Zemel (10.1016/j.ejor.2020.07.023_bib0066) 1984; 18 Li (10.1016/j.ejor.2020.07.023_bib0040) 2018; 270 Shimizu (10.1016/j.ejor.2020.07.023_bib0060) 2018 Bourjolly (10.1016/j.ejor.2020.07.023_bib0010) 1997; 20 Elhedhli (10.1016/j.ejor.2020.07.023_bib0018) 2011; 23 Louveaux (10.1016/j.ejor.2020.07.023_bib0041) 2014; 13 Falkenauer (10.1016/j.ejor.2020.07.023_bib0019) 1996; 2 Karp (10.1016/j.ejor.2020.07.023_bib0036) 1972 Bettinelli (10.1016/j.ejor.2020.07.023_bib0007) 2017; 29 Bolusani (10.1016/j.ejor.2020.07.023_sbref0009) 2020 Tomita (10.1016/j.ejor.2020.07.023_bib0062) 2007; 37 Fischetti (10.1016/j.ejor.2020.07.023_bib0021) 2018; 172 San Segundo (10.1016/j.ejor.2020.07.023_bib0057) 2016; 27 Basilico (10.1016/j.ejor.2020.07.023_bib0005) 2016 Martello (10.1016/j.ejor.2020.07.023_bib0044) 1990 Fischetti (10.1016/j.ejor.2020.07.023_bib0022) 2003; 98 Martello (10.1016/j.ejor.2020.07.023_bib0042) 1999; 45 Wu (10.1016/j.ejor.2020.07.023_bib0064) 2015; 242 Coniglio (10.1016/j.ejor.2020.07.023_bib0012) 2015 Colson (10.1016/j.ejor.2020.07.023_bib0011) 2005; 3 Basilico (10.1016/j.ejor.2020.07.023_bib0006) 2017 Dyer (10.1016/j.ejor.2020.07.023_bib0017) 1984; 29 Rossi (10.1016/j.ejor.2020.07.023_bib0051) 2001; 28 Wei (10.1016/j.ejor.2020.07.023_sbref0063) 2019 |
| References_xml | – start-page: 85 year: 1972 end-page: 103 ident: bib0036 article-title: Reducibility among combinatorial problems publication-title: Complexity of computer computations – volume: 45 start-page: 414 year: 1999 end-page: 424 ident: bib0042 article-title: Dynamic programming and strong bounds for the 0–1 knapsack problem publication-title: Management Science – volume: 73 start-page: 555 year: 1994 end-page: 561 ident: bib0014 article-title: A multi-kp modeling for the maximum-clique problem publication-title: European Journal of Operational Research – volume: 12 start-page: 133 year: 2020 end-page: 164 ident: bib0023 article-title: On integer and bilevel formulations for the publication-title: Mathematical Programming Computation – volume: 1 start-page: 169 year: 1981 end-page: 197 ident: bib0027 article-title: The ellipsoid method and its consequences in combinatorial optimization publication-title: Combinatorica – volume: 38 start-page: 571 year: 2011 end-page: 581 ident: bib0058 article-title: An exact bit-parallel algorithm for the maximum clique problem publication-title: Computers & Operations Research – year: 2020 ident: bib0009 article-title: A unified framework for multistage and multilevel mixed integer linear optimization publication-title: Bilevel optimization: Advances and next challenges – volume: 1 start-page: 169 year: 1977 end-page: 175 ident: bib0043 article-title: An upper bound for the zero-one knapsack problem and a branch and bound algorithm publication-title: European Journal of Operational Research – volume: 21 start-page: 434 year: 2011 end-page: 457 ident: bib0050 article-title: A branch and cut solver for the maximum stable set problem publication-title: Journal of Combinatorial Optimization – volume: 59 start-page: 1 year: 2014 end-page: 21 ident: bib0045 article-title: Speeding up branch and bound algorithms for solving the maximum clique problem publication-title: Journal of Global Optimization – volume: 23 start-page: 404 year: 2011 end-page: 415 ident: bib0018 article-title: A branch-and-price algorithm for the bin packing problem with conflicts publication-title: INFORMS Journal on Computing – volume: 22 start-page: 401 year: 2010 end-page: 415 ident: bib0046 article-title: Algorithms for the bin packing problem with conflicts publication-title: Informs Journal on Computing – start-page: 65 year: 2009 end-page: 78 ident: bib0016 article-title: A branch-and-cut algorithm for integer bilevel linear programs publication-title: Operations research and cyber-infrastructure – volume: 28 start-page: 63 year: 2001 end-page: 74 ident: bib0051 article-title: A branch and cut algorithm for the maximum cardinality stable set problem publication-title: Operations Research Letters – start-page: 97 year: 2015 end-page: 109 ident: bib0012 article-title: On the generation of cutting planes which maximize the bound improvement publication-title: Proceedings of 14th International Symposium on Experimental Algorithms (SEA). Lecture Notes in Computer Science, 9125 – volume: 7 start-page: 467 year: 2013 end-page: 479 ident: bib0055 article-title: An improved bit parallel exact maximum clique algorithm publication-title: Optimization Letters – start-page: 830 year: 2017 end-page: 838 ident: bib0035 article-title: An exact algorithm for the maximum weight clique problem in large graphs publication-title: Proceedings of the thirty-first AAAI conference on artificial intelligence – volume: 277 start-page: 112 year: 2019 end-page: 127 ident: bib0024 article-title: The maximum clique interdiction problem publication-title: European Journal of Operational Research – year: 2004 ident: bib0037 article-title: Knapsack problems – year: 2017 ident: bib0006 article-title: Bilevel programming approaches to the computation of optimistic and pessimistic single-leader-multi-follower equilibria publication-title: Proceedings of the 16th international symposium on experimental algorithms (SEA 2017) – volume: 13 start-page: 233 year: 2009 end-page: 249 ident: bib0048 article-title: The knapsack problem with conflict graphs publication-title: Journal of Graph Algorithms and Applications – volume: 3 start-page: 87 year: 2005 end-page: 107 ident: bib0011 article-title: Bilevel programming: A survey publication-title: 4OR – year: 2019 ident: bib0063 article-title: A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems publication-title: Journal on Computing – volume: 2 start-page: 5 year: 1996 end-page: 30 ident: bib0019 article-title: A hybrid grouping genetic algorithm for bin packing publication-title: Journal of Heuristics – volume: 57 start-page: 718 year: 2006 end-page: 726 ident: bib0030 article-title: A reactive local search-based algorithm for the disjunctively constrained knapsack problem publication-title: Journal of the Operational Research Society – volume: 25 start-page: 244 year: 2013 end-page: 255 ident: bib0052 article-title: Bin packing with conflicts: a generic branch-and-price algorithm publication-title: INFORMS Journal on Computing – volume: 27 start-page: 503 year: 1979 end-page: 515 ident: bib0061 article-title: The multiple-choice knapsack problem publication-title: Operations Research – volume: 60 start-page: 811 year: 2011 end-page: 820 ident: bib0001 article-title: Local branching-based algorithms for the disjunctively constrained knapsack problem publication-title: Computers & Industrial Engineering – volume: 44 start-page: 185 year: 2014 end-page: 192 ident: bib0059 article-title: Relaxed approximate coloring in exact maximum clique search publication-title: Computers & Operations Research – volume: 141 start-page: 165 year: 2013 end-page: 192 ident: bib0026 article-title: Strong lift-and-project cutting planes for the stable set problem publication-title: Mathematical Programming – volume: 72 start-page: 219 year: 2018 end-page: 240 ident: bib0033 article-title: A nonconvex quadratic optimization approach to the maximum edge weight clique problem publication-title: Journal of Global Optimization – start-page: 27 year: 2018 end-page: 47 ident: bib0060 article-title: A branch-and-bound based exact algorithm for the maximum edge-weight clique problem publication-title: Proceedings of the international conference on computational science/intelligence & applied informatics, CSII 2018 – volume: 29 start-page: 57 year: 1984 end-page: 63 ident: bib0017 article-title: An publication-title: Mathematical Programming – volume: 133 start-page: 481 year: 2012 end-page: 511 ident: bib0008 article-title: Clique-based facets for the precedence constrained knapsack problem publication-title: Mathematical programming – volume: 46 start-page: 1109 year: 2014 end-page: 1122 ident: bib0029 article-title: An iterative rounding search-based algorithm for the disjunctively constrained knapsack problem publication-title: Engineering Optimization – volume: 13 start-page: 22 year: 2012 end-page: 43 ident: bib0032 article-title: An algorithm for the disjunctively constrained knapsack problem publication-title: International Journal of Operational Research – volume: 98 start-page: 23 year: 2003 end-page: 47 ident: bib0022 article-title: Local branching publication-title: Mathematical Programming – volume: 110 start-page: 18 year: 2019 end-page: 33 ident: bib0054 article-title: A new branch-and-bound algorithm for the maximum weighted clique problem publication-title: Computers & Operations Research – volume: 83 start-page: 394 year: 1995 end-page: 410 ident: bib0049 article-title: A minimal algorithm for the multiple-choice knapsack problem publication-title: European Journal of Operational Research – volume: 34 start-page: 2657 year: 2007 end-page: 2673 ident: bib0031 article-title: Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem publication-title: Computers & Operations Research – volume: 27 start-page: 463 year: 2016 end-page: 487 ident: bib0057 article-title: Improved infra-chromatic bound for exact maximum clique search publication-title: Informatica, Lithuanian Academy of Sciences – volume: 270 start-page: 66 year: 2018 end-page: 77 ident: bib0040 article-title: A new upper bound for the maximum weight clique problem publication-title: European Journal of Operational Research – volume: 18 start-page: 123 year: 1984 end-page: 128 ident: bib0066 article-title: An publication-title: Information Processing Letters – volume: 143 start-page: 87 year: 2014 end-page: 110 ident: bib0004 article-title: Coordinated cutting plane generation via multi-objective separation publication-title: Mathematical Programming – volume: 278 start-page: 76 year: 2019 end-page: 90 ident: bib0053 article-title: A new branch-and-bound algorithm for the maximum edge-weighted clique problem publication-title: European Journal of Operational Research – volume: 25 start-page: 1944 year: 2015 end-page: 1963 ident: bib0025 article-title: Ellipsoidal relaxations of the stable set problem: Theory and algorithms publication-title: SIAM Journal on Optimization – volume: 43 start-page: 443 year: 1992 end-page: 457 ident: bib0047 article-title: A strong cutting plane/branch-and-bound algorithm for node packing publication-title: Journal of the Operational Research Society – volume: 43 start-page: 2864 year: 2002 end-page: 2870 ident: bib0065 article-title: Heuristic and exact algorithms for the disjunctively constrained knapsack problem publication-title: Journal of Information Processing (JIP) – volume: 172 start-page: 77 year: 2018 end-page: 103 ident: bib0021 article-title: On the use of intersection cuts for bilevel optimization publication-title: Mathematical Programming – volume: 37 start-page: 95 year: 2007 end-page: 111 ident: bib0062 article-title: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments publication-title: Journal of Global optimization – volume: 182 start-page: 105 year: 1999 end-page: 142 ident: bib0034 article-title: Clique is hard to approximate within publication-title: Acta Mathematica – volume: 29 start-page: 457 year: 2017 end-page: 473 ident: bib0007 article-title: A branch-and-bound algorithm for the knapsack problem with conflict graph publication-title: INFORMS Journal on Computing – year: 2002 ident: bib0015 article-title: Foundations of bilevel programming – volume: 20 start-page: 21 year: 1997 end-page: 29 ident: bib0010 article-title: A combinatorial column generation algorithm for the maximum stable set problem publication-title: Operations Research Letters – volume: 4 start-page: 363 year: 2012 end-page: 381 ident: bib0028 article-title: Maximum-weight stable sets and safe lower bounds for graph coloring publication-title: Mathematical Programming Computation – volume: 245 start-page: 28 year: 2018 end-page: 41 ident: bib0013 article-title: General cut-generating procedures for the stable set polytope publication-title: Discrete Applied Mathematics – volume: 84 start-page: 1 year: 2017 end-page: 15 ident: bib0039 article-title: On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem publication-title: Computers & Operations Research – volume: 30 start-page: 137 year: 2018 end-page: 153 ident: bib0038 article-title: Incremental upper bound for the maximum clique problem publication-title: INFORMS Journal on Computing – year: 1990 ident: bib0044 article-title: Knapsack problems: Algorithms and computer implementations – start-page: 169 year: 2013 end-page: 174 ident: bib0002 article-title: Energy-aware traffic engineering with elastic demands and MMF bandwidth allocation publication-title: Proceedings of the 2013 IEEE 18th international workshop on computer aided modeling and design of communication links and networks (CAMAD) – start-page: 1363 year: 2016 end-page: 1364 ident: bib0005 article-title: Methods for finding leader-follower equilibria with multiple followers publication-title: Proceedings of the 2016 international conference on autonomous agents and multiagent systems (AAMAS 2016) – volume: 242 start-page: 693 year: 2015 end-page: 709 ident: bib0064 article-title: A review on algorithms for maximum clique problems publication-title: European Journal of Operational Research – volume: 13 start-page: 36 year: 2014 end-page: 48 ident: bib0041 article-title: A combinatorial branch-and-bound algorithm for box search. publication-title: Discrete Optimization – start-page: 266 year: 2010 end-page: 275 ident: bib0003 article-title: Improving cutting plane generation with 0–1 inequalities by bi-criteria separation publication-title: Proceedings of the International symposium on experimental algorithms (SEA) – volume: 64 start-page: 293 year: 2015 end-page: 303 ident: bib0056 article-title: Infra-chromatic bound for exact maximum clique search publication-title: Computers & Operations Research – volume: 65 start-page: 1615 year: 2017 end-page: 1637 ident: bib0020 article-title: A new general-purpose algorithm for mixed-integer bilevel linear programs publication-title: Operations Research – volume: 278 start-page: 76 issue: 1 year: 2019 ident: 10.1016/j.ejor.2020.07.023_bib0053 article-title: A new branch-and-bound algorithm for the maximum edge-weighted clique problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2019.03.047 – volume: 21 start-page: 434 issue: 4 year: 2011 ident: 10.1016/j.ejor.2020.07.023_bib0050 article-title: A branch and cut solver for the maximum stable set problem publication-title: Journal of Combinatorial Optimization doi: 10.1007/s10878-009-9264-3 – volume: 60 start-page: 811 issue: 4 year: 2011 ident: 10.1016/j.ejor.2020.07.023_bib0001 article-title: Local branching-based algorithms for the disjunctively constrained knapsack problem publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2011.01.019 – volume: 2 start-page: 5 issue: 1 year: 1996 ident: 10.1016/j.ejor.2020.07.023_bib0019 article-title: A hybrid grouping genetic algorithm for bin packing publication-title: Journal of Heuristics doi: 10.1007/BF00226291 – volume: 270 start-page: 66 issue: 1 year: 2018 ident: 10.1016/j.ejor.2020.07.023_bib0040 article-title: A new upper bound for the maximum weight clique problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2018.03.020 – volume: 133 start-page: 481 issue: 1–2 year: 2012 ident: 10.1016/j.ejor.2020.07.023_bib0008 article-title: Clique-based facets for the precedence constrained knapsack problem publication-title: Mathematical programming doi: 10.1007/s10107-010-0438-7 – volume: 73 start-page: 555 issue: 3 year: 1994 ident: 10.1016/j.ejor.2020.07.023_bib0014 article-title: A multi-kp modeling for the maximum-clique problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)90252-6 – volume: 12 start-page: 133 year: 2020 ident: 10.1016/j.ejor.2020.07.023_bib0023 article-title: On integer and bilevel formulations for the k-vertex cut problem publication-title: Mathematical Programming Computation doi: 10.1007/s12532-019-00167-1 – volume: 72 start-page: 219 issue: 2 year: 2018 ident: 10.1016/j.ejor.2020.07.023_bib0033 article-title: A nonconvex quadratic optimization approach to the maximum edge weight clique problem publication-title: Journal of Global Optimization doi: 10.1007/s10898-018-0630-5 – volume: 13 start-page: 36 year: 2014 ident: 10.1016/j.ejor.2020.07.023_bib0041 article-title: A combinatorial branch-and-bound algorithm for box search. publication-title: Discrete Optimization doi: 10.1016/j.disopt.2014.05.001 – year: 2020 ident: 10.1016/j.ejor.2020.07.023_sbref0009 article-title: A unified framework for multistage and multilevel mixed integer linear optimization – year: 2019 ident: 10.1016/j.ejor.2020.07.023_sbref0063 article-title: A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems publication-title: INFORMS Journal on Computing – year: 2002 ident: 10.1016/j.ejor.2020.07.023_bib0015 – volume: 141 start-page: 165 issue: 1–2 year: 2013 ident: 10.1016/j.ejor.2020.07.023_bib0026 article-title: Strong lift-and-project cutting planes for the stable set problem publication-title: Mathematical Programming doi: 10.1007/s10107-012-0513-3 – volume: 27 start-page: 463 issue: 2 year: 2016 ident: 10.1016/j.ejor.2020.07.023_bib0057 article-title: Improved infra-chromatic bound for exact maximum clique search publication-title: Informatica, Lithuanian Academy of Sciences – volume: 37 start-page: 95 issue: 1 year: 2007 ident: 10.1016/j.ejor.2020.07.023_bib0062 article-title: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments publication-title: Journal of Global optimization doi: 10.1007/s10898-006-9039-7 – volume: 59 start-page: 1 issue: 1 year: 2014 ident: 10.1016/j.ejor.2020.07.023_bib0045 article-title: Speeding up branch and bound algorithms for solving the maximum clique problem publication-title: Journal of Global Optimization doi: 10.1007/s10898-013-0075-9 – volume: 57 start-page: 718 issue: 6 year: 2006 ident: 10.1016/j.ejor.2020.07.023_bib0030 article-title: A reactive local search-based algorithm for the disjunctively constrained knapsack problem publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2602046 – volume: 110 start-page: 18 year: 2019 ident: 10.1016/j.ejor.2020.07.023_bib0054 article-title: A new branch-and-bound algorithm for the maximum weighted clique problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2019.05.017 – volume: 22 start-page: 401 issue: 3 year: 2010 ident: 10.1016/j.ejor.2020.07.023_bib0046 article-title: Algorithms for the bin packing problem with conflicts publication-title: Informs Journal on Computing doi: 10.1287/ijoc.1090.0355 – volume: 43 start-page: 443 issue: 5 year: 1992 ident: 10.1016/j.ejor.2020.07.023_bib0047 article-title: A strong cutting plane/branch-and-bound algorithm for node packing publication-title: Journal of the Operational Research Society doi: 10.1057/jors.1992.71 – start-page: 97 year: 2015 ident: 10.1016/j.ejor.2020.07.023_bib0012 article-title: On the generation of cutting planes which maximize the bound improvement – volume: 65 start-page: 1615 issue: 6 year: 2017 ident: 10.1016/j.ejor.2020.07.023_bib0020 article-title: A new general-purpose algorithm for mixed-integer bilevel linear programs publication-title: Operations Research doi: 10.1287/opre.2017.1650 – volume: 25 start-page: 1944 issue: 3 year: 2015 ident: 10.1016/j.ejor.2020.07.023_bib0025 article-title: Ellipsoidal relaxations of the stable set problem: Theory and algorithms publication-title: SIAM Journal on Optimization doi: 10.1137/140966332 – volume: 277 start-page: 112 issue: 1 year: 2019 ident: 10.1016/j.ejor.2020.07.023_bib0024 article-title: The maximum clique interdiction problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2019.02.028 – volume: 29 start-page: 457 issue: 3 year: 2017 ident: 10.1016/j.ejor.2020.07.023_bib0007 article-title: A branch-and-bound algorithm for the knapsack problem with conflict graph publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.2016.0742 – volume: 64 start-page: 293 year: 2015 ident: 10.1016/j.ejor.2020.07.023_bib0056 article-title: Infra-chromatic bound for exact maximum clique search publication-title: Computers & Operations Research doi: 10.1016/j.cor.2015.06.009 – volume: 172 start-page: 77 issue: 1–2 year: 2018 ident: 10.1016/j.ejor.2020.07.023_bib0021 article-title: On the use of intersection cuts for bilevel optimization publication-title: Mathematical Programming doi: 10.1007/s10107-017-1189-5 – volume: 83 start-page: 394 issue: 2 year: 1995 ident: 10.1016/j.ejor.2020.07.023_bib0049 article-title: A minimal algorithm for the multiple-choice knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00015-I – volume: 43 start-page: 2864 issue: 9 year: 2002 ident: 10.1016/j.ejor.2020.07.023_bib0065 article-title: Heuristic and exact algorithms for the disjunctively constrained knapsack problem publication-title: Journal of Information Processing (JIP) – volume: 27 start-page: 503 issue: 3 year: 1979 ident: 10.1016/j.ejor.2020.07.023_bib0061 article-title: The multiple-choice knapsack problem publication-title: Operations Research doi: 10.1287/opre.27.3.503 – volume: 29 start-page: 57 issue: 1 year: 1984 ident: 10.1016/j.ejor.2020.07.023_bib0017 article-title: An O(n) algorithm for the multiple-choice knapsack linear program publication-title: Mathematical Programming doi: 10.1007/BF02591729 – start-page: 27 year: 2018 ident: 10.1016/j.ejor.2020.07.023_bib0060 article-title: A branch-and-bound based exact algorithm for the maximum edge-weight clique problem – volume: 4 start-page: 363 issue: 4 year: 2012 ident: 10.1016/j.ejor.2020.07.023_bib0028 article-title: Maximum-weight stable sets and safe lower bounds for graph coloring publication-title: Mathematical Programming Computation doi: 10.1007/s12532-012-0042-3 – volume: 245 start-page: 28 year: 2018 ident: 10.1016/j.ejor.2020.07.023_bib0013 article-title: General cut-generating procedures for the stable set polytope publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2017.02.005 – volume: 34 start-page: 2657 issue: 9 year: 2007 ident: 10.1016/j.ejor.2020.07.023_bib0031 article-title: Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2005.10.004 – volume: 28 start-page: 63 issue: 2 year: 2001 ident: 10.1016/j.ejor.2020.07.023_bib0051 article-title: A branch and cut algorithm for the maximum cardinality stable set problem publication-title: Operations Research Letters doi: 10.1016/S0167-6377(00)00060-2 – start-page: 85 year: 1972 ident: 10.1016/j.ejor.2020.07.023_bib0036 article-title: Reducibility among combinatorial problems – volume: 7 start-page: 467 issue: 3 year: 2013 ident: 10.1016/j.ejor.2020.07.023_bib0055 article-title: An improved bit parallel exact maximum clique algorithm publication-title: Optimization Letters doi: 10.1007/s11590-011-0431-y – start-page: 169 year: 2013 ident: 10.1016/j.ejor.2020.07.023_bib0002 article-title: Energy-aware traffic engineering with elastic demands and MMF bandwidth allocation – start-page: 830 year: 2017 ident: 10.1016/j.ejor.2020.07.023_bib0035 article-title: An exact algorithm for the maximum weight clique problem in large graphs – year: 2004 ident: 10.1016/j.ejor.2020.07.023_bib0037 – volume: 98 start-page: 23 issue: 1–3 year: 2003 ident: 10.1016/j.ejor.2020.07.023_bib0022 article-title: Local branching publication-title: Mathematical Programming doi: 10.1007/s10107-003-0395-5 – start-page: 266 year: 2010 ident: 10.1016/j.ejor.2020.07.023_bib0003 article-title: Improving cutting plane generation with 0–1 inequalities by bi-criteria separation – volume: 84 start-page: 1 year: 2017 ident: 10.1016/j.ejor.2020.07.023_bib0039 article-title: On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2017.02.017 – volume: 20 start-page: 21 issue: 1 year: 1997 ident: 10.1016/j.ejor.2020.07.023_bib0010 article-title: A combinatorial column generation algorithm for the maximum stable set problem publication-title: Operations Research Letters doi: 10.1016/S0167-6377(96)00038-7 – volume: 1 start-page: 169 issue: 2 year: 1981 ident: 10.1016/j.ejor.2020.07.023_bib0027 article-title: The ellipsoid method and its consequences in combinatorial optimization publication-title: Combinatorica doi: 10.1007/BF02579273 – volume: 44 start-page: 185 year: 2014 ident: 10.1016/j.ejor.2020.07.023_bib0059 article-title: Relaxed approximate coloring in exact maximum clique search publication-title: Computers & Operations Research doi: 10.1016/j.cor.2013.10.018 – volume: 242 start-page: 693 issue: 3 year: 2015 ident: 10.1016/j.ejor.2020.07.023_bib0064 article-title: A review on algorithms for maximum clique problems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2014.09.064 – volume: 13 start-page: 233 issue: 2 year: 2009 ident: 10.1016/j.ejor.2020.07.023_bib0048 article-title: The knapsack problem with conflict graphs publication-title: Journal of Graph Algorithms and Applications doi: 10.7155/jgaa.00186 – volume: 182 start-page: 105 year: 1999 ident: 10.1016/j.ejor.2020.07.023_bib0034 article-title: Clique is hard to approximate within n1−ϵ publication-title: Acta Mathematica doi: 10.1007/BF02392825 – volume: 3 start-page: 87 issue: 2 year: 2005 ident: 10.1016/j.ejor.2020.07.023_bib0011 article-title: Bilevel programming: A survey publication-title: 4OR doi: 10.1007/s10288-005-0071-0 – year: 1990 ident: 10.1016/j.ejor.2020.07.023_bib0044 – volume: 25 start-page: 244 issue: 2 year: 2013 ident: 10.1016/j.ejor.2020.07.023_bib0052 article-title: Bin packing with conflicts: a generic branch-and-price algorithm publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.1120.0499 – volume: 23 start-page: 404 issue: 3 year: 2011 ident: 10.1016/j.ejor.2020.07.023_bib0018 article-title: A branch-and-price algorithm for the bin packing problem with conflicts publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.1100.0406 – volume: 46 start-page: 1109 issue: 8 year: 2014 ident: 10.1016/j.ejor.2020.07.023_bib0029 article-title: An iterative rounding search-based algorithm for the disjunctively constrained knapsack problem publication-title: Engineering Optimization doi: 10.1080/0305215X.2013.819096 – volume: 45 start-page: 414 issue: 3 year: 1999 ident: 10.1016/j.ejor.2020.07.023_bib0042 article-title: Dynamic programming and strong bounds for the 0–1 knapsack problem publication-title: Management Science doi: 10.1287/mnsc.45.3.414 – start-page: 65 year: 2009 ident: 10.1016/j.ejor.2020.07.023_bib0016 article-title: A branch-and-cut algorithm for integer bilevel linear programs – start-page: 1363 year: 2016 ident: 10.1016/j.ejor.2020.07.023_bib0005 article-title: Methods for finding leader-follower equilibria with multiple followers – year: 2017 ident: 10.1016/j.ejor.2020.07.023_bib0006 article-title: Bilevel programming approaches to the computation of optimistic and pessimistic single-leader-multi-follower equilibria – volume: 143 start-page: 87 issue: 1–2 year: 2014 ident: 10.1016/j.ejor.2020.07.023_bib0004 article-title: Coordinated cutting plane generation via multi-objective separation publication-title: Mathematical Programming doi: 10.1007/s10107-012-0596-x – volume: 1 start-page: 169 issue: 3 year: 1977 ident: 10.1016/j.ejor.2020.07.023_bib0043 article-title: An upper bound for the zero-one knapsack problem and a branch and bound algorithm publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(77)90024-8 – volume: 13 start-page: 22 issue: 1 year: 2012 ident: 10.1016/j.ejor.2020.07.023_bib0032 article-title: An algorithm for the disjunctively constrained knapsack problem publication-title: International Journal of Operational Research doi: 10.1504/IJOR.2012.044026 – volume: 30 start-page: 137 issue: 1 year: 2018 ident: 10.1016/j.ejor.2020.07.023_bib0038 article-title: Incremental upper bound for the maximum clique problem publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.2017.0770 – volume: 18 start-page: 123 issue: 3 year: 1984 ident: 10.1016/j.ejor.2020.07.023_bib0066 article-title: An O(n) algorithm for the linear multiple choice knapsack problem and related problems publication-title: Information Processing Letters doi: 10.1016/0020-0190(84)90014-0 – volume: 38 start-page: 571 issue: 2 year: 2011 ident: 10.1016/j.ejor.2020.07.023_bib0058 article-title: An exact bit-parallel algorithm for the maximum clique problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2010.07.019 |
| SSID | ssj0001515 |
| Score | 2.5630412 |
| Snippet | •A new efficient combinatorial branch and bound algorithm for solving the KPC is described.•Several bounding procedures based on different relaxations of the... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 435 |
| SubjectTerms | Branch-and-bound algorithm Combinatorial optimization Knapsack Problem with Conflicts Maximum Weighted Clique Problem |
| Title | A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts |
| URI | https://dx.doi.org/10.1016/j.ejor.2020.07.023 |
| Volume | 289 |
| WOSCitedRecordID | wos000588034600003&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/eLvHCXMwtV3db9MwELeqDSF44KOAGF_yA2-Tp8RO4vixmob40oS0MfUtsh2na1eSqi3T_hD-YO5qJ4QOJkDiJarcOnV9v57vLve7I-S1cuBRK-6Yc9KwpMw401zlTBjjRGozoTf0sbOP8vg4H4_Vp8HgW8uFuZzLus6vrtTiv4oaxkDYSJ39C3F3N4UBeA1ChyuIHa5_JPgRdgnHVHHwedGjxpC4wfYZ50zXJTPYR2lfzyfwzvr8S5dm-KHWi5W2F0gdwBYzPkJ7GFgjq99G8IM1CwPLNq4YCgh1gWa4yXQynzYhq6zSddPBZvMEaWNBazPthk9Q67gJrLTxZq6ZN_34BO8laPmg2TXijCdrSck497TNA-d1by45y3LfXqBVztw3GAoo5D1Vm_gyJ-HUTnyx32sHgo9NzA7crMHqrzzalGr1FOetQtsnuChcE0c_SiRwsO9ymSpQ97ujd0fj990Jj0bg5ulU-BGBjOXzBre_6dcGT8-IOX1A7gXvg448ah6SgauH5HZLfhiS-22TDxp0_pDc7VWsfETORhTQRX9CF91GF-3QRQFdFNBFW3TRgC6K6KIduh6Tz2-OTg_fstCag9kkUmvmTBkhXa_irpTCxokReSVTo1JrpHBOJTbTToNza1XFMeMiUhpLD1owjkrnxBOyUze1e0oo-B-5qTIhYisSF2dap2VUactFlSVZFO-RuN2_woa69dg-ZV60CYqzAve8wD0vIlnAnu-R_W7OwldtufHTaSuWItid3p4sAEU3zHv2j_Oekzs__igvyM56-dW9JLfs5Xq6Wr4KYPsOUZKo2A |
| 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+new+combinatorial+branch-and-bound+algorithm+for+the+Knapsack+Problem+with+Conflicts&rft.jtitle=European+journal+of+operational+research&rft.au=Coniglio%2C+Stefano&rft.au=Furini%2C+Fabio&rft.au=San+Segundo%2C+Pablo&rft.date=2021-03-01&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=289&rft.issue=2&rft.spage=435&rft.epage=455&rft_id=info:doi/10.1016%2Fj.ejor.2020.07.023&rft.externalDocID=S0377221720306342 |
| 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 |