Closed-form formulas for evaluating r-flip moves to the unconstrained binary quadratic programming problem
•We propose two closed-form formulas to quickly reevaluate r-flip moves.•Algorithms are designed which are simple to implement and fast to compute.•We test our results using local search and Variable Neighborhood Search heuristics.•Experiments show relatively large reductions in time consumption usi...
Gespeichert in:
| Veröffentlicht in: | Computers & operations research Jg. 113; S. 104774 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York
Elsevier Ltd
01.01.2020
Pergamon Press Inc |
| Schlagworte: | |
| ISSN: | 0305-0548, 1873-765X, 0305-0548 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | •We propose two closed-form formulas to quickly reevaluate r-flip moves.•Algorithms are designed which are simple to implement and fast to compute.•We test our results using local search and Variable Neighborhood Search heuristics.•Experiments show relatively large reductions in time consumption using our formulas.
The Unconstrained Binary Quadratic Programming problem (UBQP) belongs to the NP-hard class and has become a framework for modeling a variety of combinatorial optimization problems. The methods most commonly used to solve instances of the UBQP explore the concept of neighborhood of a solution. Given a binary vector x ∈ {0, 1}n, solution to a UBQP instance, a neighborhood of x can be defined by flip moves. Flip moves consist on selecting one or more elements (positions) of x and “flip” their values to their complementary values (i.e., from 1 to 0 or from 0 to 1). Normally, those methods compute a large number of flip moves, and so the whole process to solve an instance can be quite time consuming. In order to reduce this time, some works have proposed ways to efficiently evaluate one or two flip moves, and also extensions to higher order moves. In this paper we propose two closed-form formulas for evaluating quickly any order of flip moves. To test our theoretical findings, we executed an extensive set of computational experiments over well-known instances for the problem. Against common belief, our results show that it is possible to compute high order flip moves very fast. |
|---|---|
| AbstractList | The Unconstrained Binary Quadratic Programming problem (UBQP) belongs to the NP-hard class and has become a framework for modeling a variety of combinatorial optimization problems. The methods most commonly used to solve instances of the UBQP explore the concept of neighborhood of a solution. Given a binary vector x ∈ {0, 1}n, solution to a UBQP instance, a neighborhood of x can be defined by flip moves. Flip moves consist on selecting one or more elements (positions) of x and "flip" their values to their complementary values (i.e., from 1 to 0 or from 0 to 1). Normally, those methods compute a large number of flip moves, and so the whole process to solve an instance can be quite time consuming. In order to reduce this time, some works have proposed ways to efficiently evaluate one or two flip moves, and also extensions to higher order moves. In this paper we propose two closed-form formulas for evaluating quickly any order of flip moves. To test our theoretical findings, we executed an extensive set of computational experiments over well-known instances for the problem. Against common belief, our results show that it is possible to compute high order flip moves very fast. •We propose two closed-form formulas to quickly reevaluate r-flip moves.•Algorithms are designed which are simple to implement and fast to compute.•We test our results using local search and Variable Neighborhood Search heuristics.•Experiments show relatively large reductions in time consumption using our formulas. The Unconstrained Binary Quadratic Programming problem (UBQP) belongs to the NP-hard class and has become a framework for modeling a variety of combinatorial optimization problems. The methods most commonly used to solve instances of the UBQP explore the concept of neighborhood of a solution. Given a binary vector x ∈ {0, 1}n, solution to a UBQP instance, a neighborhood of x can be defined by flip moves. Flip moves consist on selecting one or more elements (positions) of x and “flip” their values to their complementary values (i.e., from 1 to 0 or from 0 to 1). Normally, those methods compute a large number of flip moves, and so the whole process to solve an instance can be quite time consuming. In order to reduce this time, some works have proposed ways to efficiently evaluate one or two flip moves, and also extensions to higher order moves. In this paper we propose two closed-form formulas for evaluating quickly any order of flip moves. To test our theoretical findings, we executed an extensive set of computational experiments over well-known instances for the problem. Against common belief, our results show that it is possible to compute high order flip moves very fast. |
| ArticleNumber | 104774 |
| Author | Meneses, Cláudio N. Anacleto, Eduardo A.J. Ravelo, Santiago V. |
| Author_xml | – sequence: 1 givenname: Eduardo A.J. orcidid: 0000-0003-1417-9075 surname: Anacleto fullname: Anacleto, Eduardo A.J. email: eduardo.anacleto@ufabc.edu.br organization: Center of Mathematics, Computation and Cognition, Federal University of ABC, Santo André, Brazil – sequence: 2 givenname: Cláudio N. surname: Meneses fullname: Meneses, Cláudio N. email: claudio.meneses@ufabc.edu.br organization: Center of Mathematics, Computation and Cognition, Federal University of ABC, Santo André, Brazil – sequence: 3 givenname: Santiago V. orcidid: 0000-0001-7434-2642 surname: Ravelo fullname: Ravelo, Santiago V. email: santiago.ravelo@inf.ufrgs.br organization: Institute of Informatics, Federal University of Rio Grande do Sul, Porto Alegre, Brazil |
| BookMark | eNp9kE1rAyEQhqW00CTtD-hN6HlTXXXd0FMJ_YJALy30JsYdU5ddTXQ30H9fl_TUQz3oCPPM8D5zdO6DB4RuKFlSQqu7dmlCXJaErvKfS8nP0IzWkhWyEp_naEYYEQURvL5E85Rako8s6Qy16y4kaAobYo-na-x0mgoMR92NenB-h2NhO7fHfThCwkPAwxfg0Zvg0xC189DgrfM6fuPDqJuYGYP3Meyi7vsJz_W2g_4KXVjdJbj-fRfo4-nxff1SbN6eX9cPm8IwIYfC1lZwSkxJOFkZAdpIZiuqoeQCOGs0baDiUFldCsssVKwua06EMFtpa8bZAt2e5ua9hxHSoNowRp9XqpKVQnJGqMxd9NRlYkgpglX76PocQlGiJqWqVVmpmpSqk9LMyD-McUOOG_zkofuXvD-RkIMfHUSVjANvoHERzKCa4P6hfwCu0ZSW |
| CitedBy_id | crossref_primary_10_1016_j_cor_2023_106324 crossref_primary_10_1016_j_cor_2021_105297 crossref_primary_10_3390_a16120557 crossref_primary_10_1007_s10732_022_09498_0 |
| Cites_doi | 10.1016/S0377-2217(00)00100-4 10.1016/0166-218X(86)90065-X 10.1016/j.ejor.2010.06.039 10.1007/BF01580072 10.1287/mnsc.41.4.704 10.1016/0377-2217(84)90055-9 10.1016/0166-218X(92)90256-A 10.1016/0167-6377(94)00065-E 10.1007/s10559-011-9368-5 10.1016/0012-365X(90)90056-N 10.1016/j.asoc.2013.11.008 10.1007/s10878-016-9990-2 10.1287/mnsc.44.3.336 10.1016/j.dam.2015.04.004 10.1007/s10878-014-9734-0 10.1007/s10732-011-9169-z 10.1016/j.dam.2008.01.028 10.1007/s10898-009-9507-y 10.1007/s10589-007-9110-4 10.1007/s11590-015-0851-1 10.1016/j.cor.2011.09.008 10.3389/fphy.2014.00005 10.1007/s10732-010-9128-0 10.1504/IJMHEUR.2010.033120 10.1007/s10732-011-9189-8 10.1007/s10732-011-9180-4 10.5539/mas.v6n9p26 10.1007/s10898-011-9713-2 10.1504/IJMHEUR.2010.034201 10.1016/j.ejor.2012.07.012 10.1016/j.cor.2011.12.006 10.1016/0898-1221(91)90165-Z |
| ContentType | Journal Article |
| Copyright | 2019 Elsevier Ltd Copyright Pergamon Press Inc. Jan 2020 |
| Copyright_xml | – notice: 2019 Elsevier Ltd – notice: Copyright Pergamon Press Inc. Jan 2020 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.cor.2019.104774 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1873-765X 0305-0548 |
| ExternalDocumentID | 10_1016_j_cor_2019_104774 S0305054819302163 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XFK XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD AFXIZ AGCQF AGRNS BNPGV JQ2 L7M L~C L~D SSH |
| ID | FETCH-LOGICAL-c357t-f8f5410c20409c5eac73f61ae245e43da1de64e6fa25f3fe638284055cb7f8343 |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000500038300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0548 |
| IngestDate | Sat Jul 26 00:01:10 EDT 2025 Tue Nov 18 21:40:02 EST 2025 Sat Nov 29 07:18:52 EST 2025 Fri Feb 23 02:48:34 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Zero-one optimization Unconstrained binary quadratic programming Fast flip moves Computational efficiency |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c357t-f8f5410c20409c5eac73f61ae245e43da1de64e6fa25f3fe638284055cb7f8343 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0001-7434-2642 0000-0003-1417-9075 |
| PQID | 2325743017 |
| PQPubID | 45870 |
| ParticipantIDs | proquest_journals_2325743017 crossref_primary_10_1016_j_cor_2019_104774 crossref_citationtrail_10_1016_j_cor_2019_104774 elsevier_sciencedirect_doi_10_1016_j_cor_2019_104774 |
| PublicationCentury | 2000 |
| PublicationDate | January 2020 2020-01-00 20200101 |
| PublicationDateYYYYMMDD | 2020-01-01 |
| PublicationDate_xml | – month: 01 year: 2020 text: January 2020 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2020 |
| Publisher | Elsevier Ltd Pergamon Press Inc |
| Publisher_xml | – name: Elsevier Ltd – name: Pergamon Press Inc |
| References | Gulati, Gupta, Mittal (bib0016) 1984; 15 Lü, Glover, Hao (bib0025) 2010; 207 Barahona (bib0005) 1986; 13 Kochenberger, Lewis, Glover, Wang (bib0022) 2015; 9 Beasley (bib0006) 1998 Glover, Kochenberger, Alidaee (bib0014) 1998; 44 Chakradhar, Bushnell (bib0007) 1992; 36 Li, Sun, Liu (bib0023) 2012; 52 Kochenberger, Hao, Lü, Wang, Glover (bib0021) 2011; 19 Lü, Hao, Glover (bib0026) 2011; 17 Gueye, Michelon (bib0015) 2009; 157 Chardaire, Sutter (bib0008) 1995; 41 Dinh, Canh, Thi (bib0009) 2010; 48 Punnen, Sripratak, Karapetyan (bib0032) 2015; 193 Sherali, Lee, Adams (bib0033) 1995; 17 Shylo, Shylo (bib0034) 2011; 47 Wang, Hao, Glover, Lü, Wu (bib0037) 2016; 32 Pardalos, Rosen (bib0031) 1987; 268 Lucas (bib0027) 2014; 2 Simone (bib0035) 1990; 79 Wang, Lü, Glover, Hao (bib0039) 2012; 223 Anstreicher, K., 1998. On the equivalence of convex programming bounds for boolean quadratic programming. Unpublished. Wang, Lü, Glover, Hao (bib0038) 2012 Pardalos, Jha (bib0030) 1991; 21 Glover, Hao (bib0012) 2010; 1 Wang, Xu (bib0036) 2011; 19 Helmberg, Rendl (bib0019) 1998; 82 Mauri, Lorena (bib0028) 2012; 39 Glover, Hao (bib0011) 2010; 1 Kochenberger, Hao, Glover, Lewis, Lü, Wang, Wang (bib0020) 2014; 28 Liefooghe, Verel, Hao (bib0024) 2014; 16 Pan, Tan, Jiang (bib0029) 2008; 41 Douiri, Elbernouss (bib0010) 2012; 6 Wang, Lü, Glover, Hao (bib0040) 2013; 40 Glover, F., Kochenberger, G., 2019. A Tutorial on Formulating and Using QUBO Methods. Cornell University Library, arXiv: 1 811.11538 [cs.DS]. Hansen, Mladenović (bib0018) 2001; 130 Hanafi, Rebai, Vasquez (bib0017) 2013; 19 Li (10.1016/j.cor.2019.104774_bib0023) 2012; 52 Wang (10.1016/j.cor.2019.104774_bib0036) 2011; 19 Wang (10.1016/j.cor.2019.104774_bib0040) 2013; 40 Lü (10.1016/j.cor.2019.104774_bib0025) 2010; 207 Wang (10.1016/j.cor.2019.104774_bib0038) 2012 Glover (10.1016/j.cor.2019.104774_bib0012) 2010; 1 Lucas (10.1016/j.cor.2019.104774_bib0027) 2014; 2 Pan (10.1016/j.cor.2019.104774_bib0029) 2008; 41 Glover (10.1016/j.cor.2019.104774_bib0014) 1998; 44 Mauri (10.1016/j.cor.2019.104774_bib0028) 2012; 39 Barahona (10.1016/j.cor.2019.104774_bib0005) 1986; 13 Kochenberger (10.1016/j.cor.2019.104774_bib0022) 2015; 9 10.1016/j.cor.2019.104774_bib0004 Kochenberger (10.1016/j.cor.2019.104774_bib0020) 2014; 28 Sherali (10.1016/j.cor.2019.104774_bib0033) 1995; 17 Pardalos (10.1016/j.cor.2019.104774_bib0030) 1991; 21 Gulati (10.1016/j.cor.2019.104774_bib0016) 1984; 15 Shylo (10.1016/j.cor.2019.104774_bib0034) 2011; 47 Hansen (10.1016/j.cor.2019.104774_bib0018) 2001; 130 Douiri (10.1016/j.cor.2019.104774_bib0010) 2012; 6 Punnen (10.1016/j.cor.2019.104774_bib0032) 2015; 193 Chakradhar (10.1016/j.cor.2019.104774_bib0007) 1992; 36 Beasley (10.1016/j.cor.2019.104774_bib0006) 1998 Simone (10.1016/j.cor.2019.104774_bib0035) 1990; 79 Dinh (10.1016/j.cor.2019.104774_bib0009) 2010; 48 Wang (10.1016/j.cor.2019.104774_bib0039) 2012; 223 Chardaire (10.1016/j.cor.2019.104774_bib0008) 1995; 41 Wang (10.1016/j.cor.2019.104774_bib0037) 2016; 32 Glover (10.1016/j.cor.2019.104774_bib0011) 2010; 1 Lü (10.1016/j.cor.2019.104774_bib0026) 2011; 17 10.1016/j.cor.2019.104774_bib0013 Gueye (10.1016/j.cor.2019.104774_bib0015) 2009; 157 Kochenberger (10.1016/j.cor.2019.104774_bib0021) 2011; 19 Pardalos (10.1016/j.cor.2019.104774_bib0031) 1987; 268 Hanafi (10.1016/j.cor.2019.104774_bib0017) 2013; 19 Helmberg (10.1016/j.cor.2019.104774_bib0019) 1998; 82 Liefooghe (10.1016/j.cor.2019.104774_bib0024) 2014; 16 |
| References_xml | – reference: Glover, F., Kochenberger, G., 2019. A Tutorial on Formulating and Using QUBO Methods. Cornell University Library, arXiv: 1 811.11538 [cs.DS]. – volume: 1 start-page: 100 year: 2010 end-page: 107 ident: bib0012 article-title: Fast two-flip move evaluations for binary unconstrained quadratic optimization problems publication-title: Int. J. Metaheuristics – start-page: 395 year: 2012 end-page: 408 ident: bib0038 article-title: A Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization – volume: 268 year: 1987 ident: bib0031 article-title: Constrained Global Optimization: Algorithms and Applications (Lecture Notes in Computer Science) – volume: 52 start-page: 797 year: 2012 end-page: 829 ident: bib0023 article-title: An exact solution method for unconstrained quadratic 0–1 programming: a geometric approach publication-title: J. Glob. Optim. – volume: 157 start-page: 1255 year: 2009 end-page: 1266 ident: bib0015 article-title: A linearization framework for unconstrained quadratic (0–1) problems publication-title: Discret. Appl. Math. – volume: 40 start-page: 3100 year: 2013 end-page: 3107 ident: bib0040 article-title: Probabilistic GRASP-tabu search algorithms for the UBQP problem publication-title: Comput. Oper. Res. – volume: 39 start-page: 1577 year: 2012 end-page: 1581 ident: bib0028 article-title: Improving a lagrangian decomposition for the unconstrained binary quadratic programming problem publication-title: Comput. Oper. Res. – volume: 6 start-page: 26 year: 2012 end-page: 33 ident: bib0010 article-title: The unconstrained binary quadratic programming for the sum coloring problem publication-title: Modern Appl. Sci. – volume: 19 start-page: 645 year: 2013 end-page: 677 ident: bib0017 article-title: Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems publication-title: J. Heuristics – volume: 13 start-page: 23 year: 1986 end-page: 26 ident: bib0005 article-title: A solvable case of quadratic 0–1 programming publication-title: Discret. Appl. Math. – volume: 82 year: 1998 ident: bib0019 article-title: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes publication-title: Math. Program. – volume: 19 start-page: 529 year: 2011 end-page: 548 ident: bib0036 article-title: Metaheuristics for robust graph coloring publication-title: J. Heuristics – volume: 48 start-page: 595 year: 2010 end-page: 632 ident: bib0009 article-title: An efficient combined DCA and b&b using DC/SDP relaxation for globally solving binary quadratic programs publication-title: J. Glob. Optim. – volume: 44 start-page: 336 year: 1998 end-page: 345 ident: bib0014 article-title: Adaptive memory tabu search for binary quadratic programs publication-title: Manag. Sci. – volume: 47 start-page: 889 year: 2011 end-page: 897 ident: bib0034 article-title: Systems analysis; solving unconstrained binary quadratic programming problem by global equilibrium search publication-title: Cybern. Syst. Anal. – volume: 130 start-page: 449 year: 2001 end-page: 467 ident: bib0018 article-title: Variable neighborhood search: principles and applications publication-title: Eur. J. Oper. Res. – volume: 17 start-page: 97 year: 2011 end-page: 118 ident: bib0026 article-title: Neighborhood analysis: a case study on curriculum-Based course timetabling publication-title: J. Heuristics – volume: 32 start-page: 531 year: 2016 end-page: 549 ident: bib0037 article-title: Solving the maximum vertex weight clique problem via binary quadratic programming publication-title: J. Comb. Optim. – volume: 15 start-page: 121 year: 1984 end-page: 125 ident: bib0016 article-title: Unconstrained quadratic bivalent programming problem publication-title: Eur. J. Oper. Res. – volume: 28 start-page: 58 year: 2014 end-page: 81 ident: bib0020 article-title: The unconstrained binary quadratic programming problem: a survey publication-title: J. Comb. Optim. – volume: 207 start-page: 1254 year: 2010 end-page: 1262 ident: bib0025 article-title: A hybrid metaheuristic approach to solving the UBQP problem publication-title: Eur. J. Oper. Res. – reference: Anstreicher, K., 1998. On the equivalence of convex programming bounds for boolean quadratic programming. Unpublished. – volume: 41 start-page: 349 year: 2008 end-page: 362 ident: bib0029 article-title: A global continuation algorithm for solving binary quadratic programming problems publication-title: Comput. Optim. Appl. – volume: 21 start-page: 107 year: 1991 end-page: 113 ident: bib0030 article-title: Graph separation techniques for quadratic zero-one programming publication-title: Comput. Math. Appl. – volume: 193 start-page: 1 year: 2015 end-page: 10 ident: bib0032 article-title: The bipartite unconstrained 0–1 quadratic programming problem: polynomially solvable cases publication-title: Discret. Appl. Math. – volume: 41 start-page: 704 year: 1995 end-page: 712 ident: bib0008 article-title: A decomposition method for quadratic zero-one programming publication-title: Manag. Sci. – volume: 16 start-page: 10 year: 2014 end-page: 19 ident: bib0024 article-title: A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming publication-title: Appl. Soft Comput. – year: 1998 ident: bib0006 article-title: Heuristic Algorithms for the Unconstrained Binary Quadratic Programming Problem publication-title: Technical Report – volume: 19 start-page: 565 year: 2011 end-page: 571 ident: bib0021 article-title: Solving large scale max cut problems via tabu search publication-title: J. Heuristics – volume: 9 start-page: 1331 year: 2015 end-page: 1339 ident: bib0022 article-title: Exact solutions to generalized vertex covering problems: a Comparison of two models publication-title: Optim. Lett. – volume: 2 start-page: 5 year: 2014 ident: bib0027 article-title: Ising formulations of many NP problems publication-title: Front. Phys. – volume: 79 start-page: 71 year: 1990 end-page: 75 ident: bib0035 article-title: The cut polytope and the boolean quadric polytope publication-title: Discret. Math. – volume: 1 start-page: 3 year: 2010 end-page: 10 ident: bib0011 article-title: Efficient evaluations for solving large 0–1 unconstrained quadratic optimization problems publication-title: International Journal of Metaheuristics – volume: 223 start-page: 595 year: 2012 end-page: 604 ident: bib0039 article-title: Path relinking for unconstrained binary quadratic programming publication-title: Eur. J. Oper. Res. – volume: 36 start-page: 233 year: 1992 end-page: 251 ident: bib0007 article-title: A solvable class of quadratic 0–1 programming publication-title: Discret. Appl. Math. – volume: 17 start-page: 19 year: 1995 end-page: 26 ident: bib0033 article-title: A simultaneous lifting strategy for identifying new classes of facets for the boolean quadric polytope publication-title: Oper. Res. Lett. – volume: 130 start-page: 449 issue: 3 year: 2001 ident: 10.1016/j.cor.2019.104774_bib0018 article-title: Variable neighborhood search: principles and applications publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(00)00100-4 – volume: 13 start-page: 23 issue: 1 year: 1986 ident: 10.1016/j.cor.2019.104774_bib0005 article-title: A solvable case of quadratic 0–1 programming publication-title: Discret. Appl. Math. doi: 10.1016/0166-218X(86)90065-X – volume: 207 start-page: 1254 issue: 3 year: 2010 ident: 10.1016/j.cor.2019.104774_bib0025 article-title: A hybrid metaheuristic approach to solving the UBQP problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2010.06.039 – volume: 82 year: 1998 ident: 10.1016/j.cor.2019.104774_bib0019 article-title: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes publication-title: Math. Program. doi: 10.1007/BF01580072 – ident: 10.1016/j.cor.2019.104774_bib0004 – volume: 41 start-page: 704 issue: 4 year: 1995 ident: 10.1016/j.cor.2019.104774_bib0008 article-title: A decomposition method for quadratic zero-one programming publication-title: Manag. Sci. doi: 10.1287/mnsc.41.4.704 – volume: 15 start-page: 121 year: 1984 ident: 10.1016/j.cor.2019.104774_bib0016 article-title: Unconstrained quadratic bivalent programming problem publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(84)90055-9 – volume: 36 start-page: 233 issue: 3 year: 1992 ident: 10.1016/j.cor.2019.104774_bib0007 article-title: A solvable class of quadratic 0–1 programming publication-title: Discret. Appl. Math. doi: 10.1016/0166-218X(92)90256-A – ident: 10.1016/j.cor.2019.104774_bib0013 – volume: 17 start-page: 19 year: 1995 ident: 10.1016/j.cor.2019.104774_bib0033 article-title: A simultaneous lifting strategy for identifying new classes of facets for the boolean quadric polytope publication-title: Oper. Res. Lett. doi: 10.1016/0167-6377(94)00065-E – year: 1998 ident: 10.1016/j.cor.2019.104774_bib0006 article-title: Heuristic Algorithms for the Unconstrained Binary Quadratic Programming Problem – volume: 268 year: 1987 ident: 10.1016/j.cor.2019.104774_bib0031 – volume: 47 start-page: 889 issue: 6 year: 2011 ident: 10.1016/j.cor.2019.104774_bib0034 article-title: Systems analysis; solving unconstrained binary quadratic programming problem by global equilibrium search publication-title: Cybern. Syst. Anal. doi: 10.1007/s10559-011-9368-5 – volume: 79 start-page: 71 issue: 1 year: 1990 ident: 10.1016/j.cor.2019.104774_bib0035 article-title: The cut polytope and the boolean quadric polytope publication-title: Discret. Math. doi: 10.1016/0012-365X(90)90056-N – volume: 16 start-page: 10 year: 2014 ident: 10.1016/j.cor.2019.104774_bib0024 article-title: A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2013.11.008 – volume: 32 start-page: 531 issue: 2 year: 2016 ident: 10.1016/j.cor.2019.104774_bib0037 article-title: Solving the maximum vertex weight clique problem via binary quadratic programming publication-title: J. Comb. Optim. doi: 10.1007/s10878-016-9990-2 – volume: 44 start-page: 336 year: 1998 ident: 10.1016/j.cor.2019.104774_bib0014 article-title: Adaptive memory tabu search for binary quadratic programs publication-title: Manag. Sci. doi: 10.1287/mnsc.44.3.336 – volume: 193 start-page: 1 year: 2015 ident: 10.1016/j.cor.2019.104774_bib0032 article-title: The bipartite unconstrained 0–1 quadratic programming problem: polynomially solvable cases publication-title: Discret. Appl. Math. doi: 10.1016/j.dam.2015.04.004 – volume: 28 start-page: 58 issue: 1 year: 2014 ident: 10.1016/j.cor.2019.104774_bib0020 article-title: The unconstrained binary quadratic programming problem: a survey publication-title: J. Comb. Optim. doi: 10.1007/s10878-014-9734-0 – volume: 19 start-page: 645 issue: 4 year: 2013 ident: 10.1016/j.cor.2019.104774_bib0017 article-title: Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems publication-title: J. Heuristics doi: 10.1007/s10732-011-9169-z – volume: 157 start-page: 1255 issue: 6 year: 2009 ident: 10.1016/j.cor.2019.104774_bib0015 article-title: A linearization framework for unconstrained quadratic (0–1) problems publication-title: Discret. Appl. Math. doi: 10.1016/j.dam.2008.01.028 – volume: 48 start-page: 595 issue: 4 year: 2010 ident: 10.1016/j.cor.2019.104774_bib0009 article-title: An efficient combined DCA and b&b using DC/SDP relaxation for globally solving binary quadratic programs publication-title: J. Glob. Optim. doi: 10.1007/s10898-009-9507-y – volume: 41 start-page: 349 issue: 3 year: 2008 ident: 10.1016/j.cor.2019.104774_bib0029 article-title: A global continuation algorithm for solving binary quadratic programming problems publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-007-9110-4 – volume: 9 start-page: 1331 issue: 7 year: 2015 ident: 10.1016/j.cor.2019.104774_bib0022 article-title: Exact solutions to generalized vertex covering problems: a Comparison of two models publication-title: Optim. Lett. doi: 10.1007/s11590-015-0851-1 – volume: 39 start-page: 1577 issue: 7 year: 2012 ident: 10.1016/j.cor.2019.104774_bib0028 article-title: Improving a lagrangian decomposition for the unconstrained binary quadratic programming problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2011.09.008 – volume: 2 start-page: 5 year: 2014 ident: 10.1016/j.cor.2019.104774_bib0027 article-title: Ising formulations of many NP problems publication-title: Front. Phys. doi: 10.3389/fphy.2014.00005 – volume: 17 start-page: 97 issue: 2 year: 2011 ident: 10.1016/j.cor.2019.104774_bib0026 article-title: Neighborhood analysis: a case study on curriculum-Based course timetabling publication-title: J. Heuristics doi: 10.1007/s10732-010-9128-0 – volume: 1 start-page: 3 issue: 1 year: 2010 ident: 10.1016/j.cor.2019.104774_bib0011 article-title: Efficient evaluations for solving large 0–1 unconstrained quadratic optimization problems publication-title: International Journal of Metaheuristics doi: 10.1504/IJMHEUR.2010.033120 – volume: 19 start-page: 565 issue: 4 year: 2011 ident: 10.1016/j.cor.2019.104774_bib0021 article-title: Solving large scale max cut problems via tabu search publication-title: J. Heuristics doi: 10.1007/s10732-011-9189-8 – volume: 19 start-page: 529 issue: 4 year: 2011 ident: 10.1016/j.cor.2019.104774_bib0036 article-title: Metaheuristics for robust graph coloring publication-title: J. Heuristics doi: 10.1007/s10732-011-9180-4 – volume: 6 start-page: 26 issue: 9 year: 2012 ident: 10.1016/j.cor.2019.104774_bib0010 article-title: The unconstrained binary quadratic programming for the sum coloring problem publication-title: Modern Appl. Sci. doi: 10.5539/mas.v6n9p26 – volume: 52 start-page: 797 issue: 4 year: 2012 ident: 10.1016/j.cor.2019.104774_bib0023 article-title: An exact solution method for unconstrained quadratic 0–1 programming: a geometric approach publication-title: J. Glob. Optim. doi: 10.1007/s10898-011-9713-2 – volume: 1 start-page: 100 issue: 2 year: 2010 ident: 10.1016/j.cor.2019.104774_bib0012 article-title: Fast two-flip move evaluations for binary unconstrained quadratic optimization problems publication-title: Int. J. Metaheuristics doi: 10.1504/IJMHEUR.2010.034201 – volume: 223 start-page: 595 issue: 3 year: 2012 ident: 10.1016/j.cor.2019.104774_bib0039 article-title: Path relinking for unconstrained binary quadratic programming publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2012.07.012 – volume: 40 start-page: 3100 issue: 12 year: 2013 ident: 10.1016/j.cor.2019.104774_bib0040 article-title: Probabilistic GRASP-tabu search algorithms for the UBQP problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2011.12.006 – volume: 21 start-page: 107 issue: 6 year: 1991 ident: 10.1016/j.cor.2019.104774_bib0030 article-title: Graph separation techniques for quadratic zero-one programming publication-title: Comput. Math. Appl. doi: 10.1016/0898-1221(91)90165-Z – start-page: 395 year: 2012 ident: 10.1016/j.cor.2019.104774_bib0038 |
| SSID | ssj0000721 |
| Score | 2.3298388 |
| Snippet | •We propose two closed-form formulas to quickly reevaluate r-flip moves.•Algorithms are designed which are simple to implement and fast to compute.•We test our... The Unconstrained Binary Quadratic Programming problem (UBQP) belongs to the NP-hard class and has become a framework for modeling a variety of combinatorial... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 104774 |
| SubjectTerms | Closed form solutions Combinatorial analysis Computational efficiency Exact solutions Fast flip moves Mathematical analysis Mathematical programming Operations research Optimization Quadratic programming Unconstrained binary quadratic programming Zero-one optimization |
| Title | Closed-form formulas for evaluating r-flip moves to the unconstrained binary quadratic programming problem |
| URI | https://dx.doi.org/10.1016/j.cor.2019.104774 https://www.proquest.com/docview/2325743017 |
| Volume | 113 |
| WOSCitedRecordID | wos000500038300001&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: 1873-765X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bj9JAFJ7grjH64AXXuLqaeXBfNE3amZa2jwQhalbcGDbhbTJ0ZjYQtmW5ZX-SP9MzNyhkJfrgS1MKhcL3cc7XM-eC0AdSFKGKOA_yTIkgbokoGIFqDQQhqRKKh5kcmWETab-fDYf5ZaPxy9fCrKdpWWZ3d_nsv0INxwBsXTr7D3Bv3hQOwD6ADluAHbZ_BXxnWi2kCLQYNaWJK9DHO4299XChQE3Hs0831dp2eNDqExyc1op6ZIRWpbZO93bFxdw0dXWJXDe2et1MoakLWz8dYmG4VM3k3OXYuW5Cm6hzu-RwwWZ4k84uAYJWtbD2d216reXqTM0ifrQS42q7YPST6yQnG8suwTpdVy5N10UuSLgXubiU82s9Uckmm-zmfWozFICatKZZ3nPMG--I1sxvdK9TsPGJCWCqG8BGuV7XTu1soN0G3P0frHd1ccEG3eHgnPZmt4GeTqZX8c_pZ8uUB-iYpEkO9vO4_bU7_Lb1-qmp8dtcpF9BN7mEe5_8Jw20pwaMxBk8R0_dvQluW069QA1ZNtEjXxrRRM88yNh5hCZ6Uutn-RJNatzDnnt6B2-5hy33sOEeXlYYuId3uIct9_CGe7jGPey4d4Kuet1B50vghnkEBU3SZaAylcRRWBDwGnmRgL9PqWpFXJI4kTEVPBKyFcuW4iRRVEnwC6CcwiQpRqnKaExfoaOyKuVrhDNCeUgKUYSyiHMClmYU0lGLR_BIUJWcotD_vKxwne71N5gyn9I4YYAI04gwi8gp-rg5ZWbbvBx6cewxY06nWv3JgHGHTjvz-DJnLxYMbmgSEPHgF98cfvoterz9D52ho-V8Jd-hh8V6OV7M3zs2_gbuKL8J |
| 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=Closed-form+formulas+for+evaluating+r-flip+moves+to+the+unconstrained+binary+quadratic+programming+problem&rft.jtitle=Computers+%26+operations+research&rft.au=Anacleto%2C+Eduardo+AJ&rft.au=Meneses%2C+Cl%C3%A1udio+N&rft.au=Ravelo%2C+Santiago+V&rft.date=2020-01-01&rft.pub=Pergamon+Press+Inc&rft.issn=0305-0548&rft.eissn=0305-0548&rft.volume=113&rft.spage=1&rft_id=info:doi/10.1016%2Fj.cor.2019.104774&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |