Surrogate “Level-Based” Lagrangian Relaxation for mixed-integer linear programming
Mixed-Integer Linear Programming (MILP) plays an important role across a range of scientific disciplines and within areas of strategic importance to society. The MILP problems, however, suffer from combinatorial complexity . Because of integer decision variables, as the problem size increases, the n...
Saved in:
| Published in | Scientific reports Vol. 12; no. 1; pp. 22417 - 12 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
London
Nature Publishing Group UK
27.12.2022
Nature Publishing Group Nature Portfolio |
| Subjects | |
| Online Access | Get full text |
| ISSN | 2045-2322 2045-2322 |
| DOI | 10.1038/s41598-022-26264-1 |
Cover
| Abstract | Mixed-Integer Linear Programming (MILP) plays an important role across a range of scientific disciplines and within areas of strategic importance to society. The MILP problems, however, suffer from
combinatorial complexity
. Because of integer decision variables, as the problem size increases, the number of possible solutions increases
super-linearly
thereby leading to a drastic increase in the computational effort. To efficiently solve MILP problems, a “price-based” decomposition and coordination approach is developed to exploit 1. the super-linear reduction of complexity upon the decomposition and 2. the geometric convergence potential inherent to Polyak’s stepsizing formula for the fastest coordination possible to obtain near-optimal solutions in a computationally efficient manner. Unlike all previous methods to set stepsizes heuristically by adjusting hyperparameters, the key novel way to obtain stepsizes is purely decision-based: a novel “auxiliary” constraint satisfaction problem is solved, from which the appropriate stepsizes are inferred. Testing results for large-scale Generalized Assignment Problems demonstrate that for the majority of instances, certifiably optimal solutions are obtained. For stochastic job-shop scheduling as well as for pharmaceutical scheduling, computational results demonstrate the two orders of magnitude speedup as compared to Branch-and-Cut. The new method has a major impact on the efficient resolution of complex Mixed-Integer Programming problems arising within a variety of scientific fields. |
|---|---|
| AbstractList | Mixed-Integer Linear Programming (MILP) plays an important role across a range of scientific disciplines and within areas of strategic importance to society. The MILP problems, however, suffer from combinatorial complexity. Because of integer decision variables, as the problem size increases, the number of possible solutions increases super-linearly thereby leading to a drastic increase in the computational effort. To efficiently solve MILP problems, a “price-based” decomposition and coordination approach is developed to exploit 1. the super-linear reduction of complexity upon the decomposition and 2. the geometric convergence potential inherent to Polyak’s stepsizing formula for the fastest coordination possible to obtain near-optimal solutions in a computationally efficient manner. Unlike all previous methods to set stepsizes heuristically by adjusting hyperparameters, the key novel way to obtain stepsizes is purely decision-based: a novel “auxiliary” constraint satisfaction problem is solved, from which the appropriate stepsizes are inferred. Testing results for large-scale Generalized Assignment Problems demonstrate that for the majority of instances, certifiably optimal solutions are obtained. For stochastic job-shop scheduling as well as for pharmaceutical scheduling, computational results demonstrate the two orders of magnitude speedup as compared to Branch-and-Cut. The new method has a major impact on the efficient resolution of complex Mixed-Integer Programming problems arising within a variety of scientific fields. Abstract Mixed-Integer Linear Programming (MILP) plays an important role across a range of scientific disciplines and within areas of strategic importance to society. The MILP problems, however, suffer from combinatorial complexity. Because of integer decision variables, as the problem size increases, the number of possible solutions increases super-linearly thereby leading to a drastic increase in the computational effort. To efficiently solve MILP problems, a “price-based” decomposition and coordination approach is developed to exploit 1. the super-linear reduction of complexity upon the decomposition and 2. the geometric convergence potential inherent to Polyak’s stepsizing formula for the fastest coordination possible to obtain near-optimal solutions in a computationally efficient manner. Unlike all previous methods to set stepsizes heuristically by adjusting hyperparameters, the key novel way to obtain stepsizes is purely decision-based: a novel “auxiliary” constraint satisfaction problem is solved, from which the appropriate stepsizes are inferred. Testing results for large-scale Generalized Assignment Problems demonstrate that for the majority of instances, certifiably optimal solutions are obtained. For stochastic job-shop scheduling as well as for pharmaceutical scheduling, computational results demonstrate the two orders of magnitude speedup as compared to Branch-and-Cut. The new method has a major impact on the efficient resolution of complex Mixed-Integer Programming problems arising within a variety of scientific fields. Mixed-Integer Linear Programming (MILP) plays an important role across a range of scientific disciplines and within areas of strategic importance to society. The MILP problems, however, suffer from combinatorial complexity . Because of integer decision variables, as the problem size increases, the number of possible solutions increases super-linearly thereby leading to a drastic increase in the computational effort. To efficiently solve MILP problems, a “price-based” decomposition and coordination approach is developed to exploit 1. the super-linear reduction of complexity upon the decomposition and 2. the geometric convergence potential inherent to Polyak’s stepsizing formula for the fastest coordination possible to obtain near-optimal solutions in a computationally efficient manner. Unlike all previous methods to set stepsizes heuristically by adjusting hyperparameters, the key novel way to obtain stepsizes is purely decision-based: a novel “auxiliary” constraint satisfaction problem is solved, from which the appropriate stepsizes are inferred. Testing results for large-scale Generalized Assignment Problems demonstrate that for the majority of instances, certifiably optimal solutions are obtained. For stochastic job-shop scheduling as well as for pharmaceutical scheduling, computational results demonstrate the two orders of magnitude speedup as compared to Branch-and-Cut. The new method has a major impact on the efficient resolution of complex Mixed-Integer Programming problems arising within a variety of scientific fields. Mixed-Integer Linear Programming (MILP) plays an important role across a range of scientific disciplines and within areas of strategic importance to society. The MILP problems, however, suffer from combinatorial complexity. Because of integer decision variables, as the problem size increases, the number of possible solutions increases super-linearly thereby leading to a drastic increase in the computational effort. To efficiently solve MILP problems, a "price-based" decomposition and coordination approach is developed to exploit 1. the super-linear reduction of complexity upon the decomposition and 2. the geometric convergence potential inherent to Polyak's stepsizing formula for the fastest coordination possible to obtain near-optimal solutions in a computationally efficient manner. Unlike all previous methods to set stepsizes heuristically by adjusting hyperparameters, the key novel way to obtain stepsizes is purely decision-based: a novel "auxiliary" constraint satisfaction problem is solved, from which the appropriate stepsizes are inferred. Testing results for large-scale Generalized Assignment Problems demonstrate that for the majority of instances, certifiably optimal solutions are obtained. For stochastic job-shop scheduling as well as for pharmaceutical scheduling, computational results demonstrate the two orders of magnitude speedup as compared to Branch-and-Cut. The new method has a major impact on the efficient resolution of complex Mixed-Integer Programming problems arising within a variety of scientific fields.Mixed-Integer Linear Programming (MILP) plays an important role across a range of scientific disciplines and within areas of strategic importance to society. The MILP problems, however, suffer from combinatorial complexity. Because of integer decision variables, as the problem size increases, the number of possible solutions increases super-linearly thereby leading to a drastic increase in the computational effort. To efficiently solve MILP problems, a "price-based" decomposition and coordination approach is developed to exploit 1. the super-linear reduction of complexity upon the decomposition and 2. the geometric convergence potential inherent to Polyak's stepsizing formula for the fastest coordination possible to obtain near-optimal solutions in a computationally efficient manner. Unlike all previous methods to set stepsizes heuristically by adjusting hyperparameters, the key novel way to obtain stepsizes is purely decision-based: a novel "auxiliary" constraint satisfaction problem is solved, from which the appropriate stepsizes are inferred. Testing results for large-scale Generalized Assignment Problems demonstrate that for the majority of instances, certifiably optimal solutions are obtained. For stochastic job-shop scheduling as well as for pharmaceutical scheduling, computational results demonstrate the two orders of magnitude speedup as compared to Branch-and-Cut. The new method has a major impact on the efficient resolution of complex Mixed-Integer Programming problems arising within a variety of scientific fields. |
| ArticleNumber | 22417 |
| Author | Tucker, Emily L. Bragin, Mikhail A. |
| Author_xml | – sequence: 1 givenname: Mikhail A. surname: Bragin fullname: Bragin, Mikhail A. email: mikhail.bragin@uconn.edu organization: Department of Electrical and Computer Engineering, University of Connecticut – sequence: 2 givenname: Emily L. surname: Tucker fullname: Tucker, Emily L. organization: Department of Industrial Engineering, Clemson University |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/36575204$$D View this record in MEDLINE/PubMed |
| BookMark | eNqNUstu3CAUtapUTTLND3RRWeqmG7eAwYZNpSbqI9JIlfraIgYuLiMbpmCnyS4fkv5cvqTMo2mSRVQ2IO45h3PP5bDY88FDUTzD6BVGNX-dKGaCV4iQijSkoRV-VBwQRFlFakL2bp33i6OUligvRgTF4kmxXzesZRlwUHz_MsUYOjVCeX15NYcz6KtjlcBcX_4u56qLyndO-fIz9OpcjS740oZYDu4cTOX8CB3EsnceVCxXWSiqYXC-e1o8tqpPcLTbZ8W39---nnys5p8-nJ68nVeaUTRW0DQtN8pYwTUwZkktyAIsbQSxBBa0tYqxusUUDNNIIaOpZYIRDVy3C7OoZ8XpVtcEtZSr6AYVL2RQTm4uQuykiqPTPcjW8pxTrSg2POtxkZ_ByFqNjME2V2ZFvdWa_Epd_FJ9fyOIkVyHLrehyxy63IQucWa92bJW02IAo8GPUfV3rNytePdDduFMilZQXq8FXu4EYvg5QRrl4JKGvlcewpQkaZlAKA-LZOiLe9BlmKLPAa9RPPeDa5RRz287urHyd-gZwLcAHUNKEazUbtzMNht0_cPdknvU_4poF2zKYJ8_zD_bD7D-ADro494 |
| CitedBy_id | crossref_primary_10_1145_3624476 crossref_primary_10_3390_en17194851 |
| Cites_doi | 10.1023/A:1022646725208 10.1137/S1052623499362111 10.1049/iet-gtd.2018.6314 10.1038/s43588-020-00009-4 10.1016/j.vaccine.2015.09.088 10.1016/j.asoc.2011.06.001 10.1016/j.cie.2019.02.002 10.1038/nature19946 10.1016/S0925-5273(01)00140-2 10.1016/j.ejor.2010.06.002 10.1007/s00500-015-1647-z 10.1109/TASE.2018.2835298 10.1109/70.210791 10.1007/s101070050053 10.1007/s13369-021-06317-9 10.1002/amp2.10141 10.1016/j.cor.2022.105862 10.1016/j.compchemeng.2021.107346 10.1287/opre.2020.2093 10.1007/s10729-016-9390-2 10.1016/j.ejor.2011.06.021 10.1016/j.asoc.2012.02.024 10.1016/j.tre.2019.08.005 10.1007/s10288-018-0389-z 10.1016/j.tre.2018.06.005 10.1016/j.ejor.2022.03.014 10.1016/0041-5553(69)90061-5 10.1007/s10589-011-9432-0 10.1038/nenergy.2017.50 10.1016/j.engappai.2018.10.007 10.1002/amp2.10140 10.1016/j.ejor.2021.07.031 10.1016/j.tre.2021.102371 10.1016/j.cor.2021.105616 10.1109/TASE.2020.2998048 10.1007/s10845-020-01703-w 10.1007/s10957-014-0561-3 10.1080/03155986.2021.1881359 10.1109/TPWRS.2020.3005407 |
| ContentType | Journal Article |
| Copyright | The Author(s) 2022. corrected publication 2023 2022. The Author(s). The Author(s) 2022. corrected publication 2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. The Author(s) 2022 |
| Copyright_xml | – notice: The Author(s) 2022. corrected publication 2023 – notice: 2022. The Author(s). – notice: The Author(s) 2022. corrected publication 2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. – notice: The Author(s) 2022 |
| DBID | C6C AAYXX CITATION CGR CUY CVF ECM EIF NPM 3V. 7X7 7XB 88A 88E 88I 8FE 8FH 8FI 8FJ 8FK ABUWG AEUYN AFKRA AZQEC BBNVY BENPR BHPHI CCPQU DWQXO FYUFA GHDGH GNUQQ HCIFZ K9. LK8 M0S M1P M2P M7P PHGZM PHGZT PIMPY PJZUB PKEHL PPXIY PQEST PQGLB PQQKQ PQUKI PRINS Q9U 7X8 5PM ADTOC UNPAY DOA |
| DOI | 10.1038/s41598-022-26264-1 |
| DatabaseName | Springer Nature OA Free Journals CrossRef Medline MEDLINE MEDLINE (Ovid) MEDLINE MEDLINE PubMed ProQuest Central (Corporate) Health & Medical Collection ProQuest Central (purchase pre-March 2016) Biology Database (Alumni Edition) Medical Database (Alumni Edition) Science Database (Alumni Edition) ProQuest SciTech Collection ProQuest Natural Science Journals ProQuest Hospital Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest One Sustainability ProQuest Central UK/Ireland ProQuest Central Essentials - QC Biological Science Collection ProQuest Central Natural Science Collection ProQuest One Community College ProQuest Central Proquest Health Research Premium Collection Health Research Premium Collection (Alumni) ProQuest Central Student SciTech Premium Collection ProQuest Health & Medical Complete (Alumni) Biological Sciences ProQuest Health & Medical Collection Medical Database Science Database (ProQuest) Biological Science Database Proquest Central Premium ProQuest One Academic ProQuest: Publicly Available Content ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) ProQuest One Health & Nursing ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic MEDLINE - Academic PubMed Central (Full Participant titles) Unpaywall for CDI: Periodical Content Unpaywall DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef MEDLINE Medline Complete MEDLINE with Full Text PubMed MEDLINE (Ovid) Publicly Available Content Database ProQuest Central Student ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest One Health & Nursing ProQuest Natural Science Collection ProQuest Central China ProQuest Biology Journals (Alumni Edition) ProQuest Central ProQuest One Applied & Life Sciences ProQuest One Sustainability ProQuest Health & Medical Research Collection Health Research Premium Collection Health and Medicine Complete (Alumni Edition) Natural Science Collection ProQuest Central Korea Health & Medical Research Collection Biological Science Collection ProQuest Central (New) ProQuest Medical Library (Alumni) ProQuest Science Journals (Alumni Edition) ProQuest Biological Science Collection ProQuest Central Basic ProQuest Science Journals ProQuest One Academic Eastern Edition ProQuest Hospital Collection Health Research Premium Collection (Alumni) Biological Science Database ProQuest SciTech Collection ProQuest Hospital Collection (Alumni) ProQuest Health & Medical Complete ProQuest Medical Library ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) MEDLINE - Academic |
| DatabaseTitleList | Publicly Available Content Database CrossRef MEDLINE - Academic MEDLINE |
| Database_xml | – sequence: 1 dbid: C6C name: Springer Nature OA Free Journals url: http://www.springeropen.com/ sourceTypes: Publisher – sequence: 2 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 3 dbid: NPM name: PubMed url: https://proxy.k.utb.cz/login?url=http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 4 dbid: EIF name: MEDLINE url: https://proxy.k.utb.cz/login?url=https://www.webofscience.com/wos/medline/basic-search sourceTypes: Index Database – sequence: 5 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository – sequence: 6 dbid: BENPR name: ProQuest Central url: http://www.proquest.com/pqcentral?accountid=15518 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Biology |
| EISSN | 2045-2322 |
| EndPage | 12 |
| ExternalDocumentID | oai_doaj_org_article_7f86263a41d84ed89f4610ffc0dd1f26 10.1038/s41598-022-26264-1 PMC9794831 36575204 10_1038_s41598_022_26264_1 |
| Genre | Research Support, U.S. Gov't, Non-P.H.S Journal Article |
| GrantInformation_xml | – fundername: US NSF grantid: ECCS-1810108 – fundername: ; grantid: ECCS-1810108 |
| GroupedDBID | 0R~ 3V. 4.4 53G 5VS 7X7 88A 88E 88I 8FE 8FH 8FI 8FJ AAFWJ AAJSJ AAKDD ABDBF ABUWG ACGFS ACSMW ACUHS ADBBV ADRAZ AENEX AEUYN AFKRA AJTQC ALIPV ALMA_UNASSIGNED_HOLDINGS AOIJS AZQEC BAWUL BBNVY BCNDV BENPR BHPHI BPHCQ BVXVI C6C CCPQU DIK DWQXO EBD EBLON EBS ESX FYUFA GNUQQ GROUPED_DOAJ GX1 HCIFZ HH5 HMCUK HYE KQ8 LK8 M0L M1P M2P M48 M7P M~E NAO OK1 PIMPY PQQKQ PROAC PSQYO RNT RNTTT RPM SNYQT UKHRP AASML AAYXX AFPKN CITATION PHGZM PHGZT PJZUB PPXIY PQGLB PUEGO CGR CUY CVF ECM EIF NPM 7XB 8FK K9. PKEHL PQEST PQUKI PRINS Q9U 7X8 5PM ADTOC EJD IPNFZ RIG UNPAY |
| ID | FETCH-LOGICAL-c540t-e6678dadf98ce55f2392bef4692f2eb47fa553714ed5c0a0dc4f5952ce8c7bdb3 |
| IEDL.DBID | M48 |
| ISSN | 2045-2322 |
| IngestDate | Fri Oct 03 12:45:22 EDT 2025 Sun Oct 26 03:41:17 EDT 2025 Tue Sep 30 17:17:27 EDT 2025 Fri Sep 05 14:15:17 EDT 2025 Tue Oct 07 08:55:28 EDT 2025 Mon Jul 21 05:58:40 EDT 2025 Wed Oct 01 01:38:28 EDT 2025 Thu Apr 24 23:12:23 EDT 2025 Fri Feb 21 02:39:15 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| License | 2022. The Author(s). Open AccessThis article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c540t-e6678dadf98ce55f2392bef4692f2eb47fa553714ed5c0a0dc4f5952ce8c7bdb3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| OpenAccessLink | http://journals.scholarsportal.info/openUrl.xqy?doi=10.1038/s41598-022-26264-1 |
| PMID | 36575204 |
| PQID | 2758461130 |
| PQPubID | 2041939 |
| PageCount | 12 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_7f86263a41d84ed89f4610ffc0dd1f26 unpaywall_primary_10_1038_s41598_022_26264_1 pubmedcentral_primary_oai_pubmedcentral_nih_gov_9794831 proquest_miscellaneous_2759002042 proquest_journals_2758461130 pubmed_primary_36575204 crossref_citationtrail_10_1038_s41598_022_26264_1 crossref_primary_10_1038_s41598_022_26264_1 springer_journals_10_1038_s41598_022_26264_1 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2022-12-27 |
| PublicationDateYYYYMMDD | 2022-12-27 |
| PublicationDate_xml | – month: 12 year: 2022 text: 2022-12-27 day: 27 |
| PublicationDecade | 2020 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London – name: England |
| PublicationTitle | Scientific reports |
| PublicationTitleAbbrev | Sci Rep |
| PublicationTitleAlternate | Sci Rep |
| PublicationYear | 2022 |
| Publisher | Nature Publishing Group UK Nature Publishing Group Nature Portfolio |
| Publisher_xml | – name: Nature Publishing Group UK – name: Nature Publishing Group – name: Nature Portfolio |
| References | Sun, Tu, Bragin, Zhang (CR41) 2022 Wilson, Shen, Awasthi, Bollas, Gupta (CR40) 2022 Zhu, Ursavas (CR15) 2018; 118 Nedić, Bertsekas (CR25) 2001; 12 Ge, Yuan (CR16) 2021; 151 Jamili (CR38) 2019; 78 Zhang, Song, Wu (CR36) 2013; 13 Ahani, Andersson, Martinello, Teytelboym, Trapp (CR7) 2021; 69 Reddy, Kumar, Choudhary, Cheng (CR21) 2022 CR32 Öztop, Tasgetiren, Kandiller, Pan (CR12) 2022; 138 Chen, Pan, Holzer, Rothberg, Ma, Veeramany (CR18) 2020; 36 Posta, Ferland, Philippe (CR31) 2012; 52 Stefansson, Sigmarsdottir, Jensson, Shah (CR14) 2011; 215 Polyak (CR22) 1969; 9 Lei (CR35) 2011; 11 Khlif Hachicha, Zeghal Mansour (CR3) 2018; 21 Bragin, Luh, Yan, Sun (CR28) 2019; 16 Horng, Lin (CR39) 2022; 47 Kamyabniya, Noormohammadzadeh, Sauré, Patrick (CR8) 2021; 152 Kopanos, Méndez, Puigjaner (CR13) 2010; 207 Zhao, Luh, Wang (CR23) 1999; 100 Schill, Pahle, Gambardella (CR17) 2017; 2 Nedić, Bertsekas, Uryasev, Pardalos (CR27) 2001 Kayvanfar, Akbari Jokar, Rafiee, Sheikh, Iranzad (CR4) 2021; 59 Liu, Li, Gao (CR9) 2021; 32 Goffin, Kiwiel (CR24) 1999; 85 Golenko-Ginzburg, Gonik (CR34) 2002; 76 Yang, Chen, Goodison, Sun (CR2) 2021; 1 Bragin, Yan, Luh (CR30) 2020; 18 Balogh, Garraffa, O’Sullivan, Salassa (CR11) 2022 Hoitomt, Luh, Pattipati (CR29) 1993; 9 Haddadi (CR33) 2019; 17 Huang, Boyken, Baker (CR1) 2016; 537 Hong, Chou, Lee (CR10) 2019; 129 CR42 Hamdan, Diabat (CR6) 2020; 134 Shen, Zhu (CR37) 2016; 20 Li, Zhai, Guan (CR19) 2020; 14 Bragin, Luh, Yan, Yu, Stern (CR26) 2015; 164 Smalley, Keskinocak, Swann, Hinman (CR5) 2015; 33 Archetti, Peirano, Speranza (CR20) 2022; 299 W-P Schill (26264_CR17) 2017; 2 HK Smalley (26264_CR5) 2015; 33 B Hamdan (26264_CR6) 2020; 134 A Kamyabniya (26264_CR8) 2021; 152 PS Huang (26264_CR1) 2016; 537 X Zhao (26264_CR23) 1999; 100 26264_CR42 L Yang (26264_CR2) 2021; 1 Q Liu (26264_CR9) 2021; 32 A Nedić (26264_CR27) 2001 S Haddadi (26264_CR33) 2019; 17 MA Bragin (26264_CR26) 2015; 164 H Öztop (26264_CR12) 2022; 138 Y Sun (26264_CR41) 2022 D Golenko-Ginzburg (26264_CR34) 2002; 76 D Lei (26264_CR35) 2011; 11 J-L Goffin (26264_CR24) 1999; 85 DJ Hoitomt (26264_CR29) 1993; 9 MA Bragin (26264_CR30) 2020; 18 X Li (26264_CR19) 2020; 14 H Stefansson (26264_CR14) 2011; 215 26264_CR32 A Nedić (26264_CR25) 2001; 12 SX Zhu (26264_CR15) 2018; 118 H Khlif Hachicha (26264_CR3) 2018; 21 A Balogh (26264_CR11) 2022 J Shen (26264_CR37) 2016; 20 V Kayvanfar (26264_CR4) 2021; 59 SC Horng (26264_CR39) 2022; 47 R Zhang (26264_CR36) 2013; 13 GM Kopanos (26264_CR13) 2010; 207 MA Bragin (26264_CR28) 2019; 16 C Ge (26264_CR16) 2021; 151 C Archetti (26264_CR20) 2022; 299 N Ahani (26264_CR7) 2021; 69 KN Reddy (26264_CR21) 2022 M Posta (26264_CR31) 2012; 52 JP Wilson (26264_CR40) 2022 Y Chen (26264_CR18) 2020; 36 I-H Hong (26264_CR10) 2019; 129 BT Polyak (26264_CR22) 1969; 9 A Jamili (26264_CR38) 2019; 78 36859563 - Sci Rep. 2023 Mar 1;13(1):3474. doi: 10.1038/s41598-023-30358-9 |
| References_xml | – volume: 100 start-page: 699 issue: 3 year: 1999 end-page: 712 ident: CR23 article-title: Surrogate gradient algorithm for Lagrangian relaxation publication-title: J. Optim. Theory Appl. doi: 10.1023/A:1022646725208 – volume: 12 start-page: 109 issue: 1 year: 2001 end-page: 138 ident: CR25 article-title: Incremental subgradient methods for nondifferentiable optimization publication-title: SIAM J. Optim. doi: 10.1137/S1052623499362111 – volume: 14 start-page: 2968 issue: 15 year: 2020 end-page: 2975 ident: CR19 article-title: Robust transmission constrained unit commitment: A column merging method publication-title: IET Gener. Transm. Distrib. doi: 10.1049/iet-gtd.2018.6314 – volume: 1 start-page: 79 year: 2021 end-page: 88 ident: CR2 article-title: An efficient and effective method to identify significantly perturbed subnetworks in cancer publication-title: Nat. Comput. Sci. doi: 10.1038/s43588-020-00009-4 – volume: 33 start-page: 6218 issue: 46 year: 2015 end-page: 6223 ident: CR5 article-title: Optimized oral cholera vaccine distribution strategies to minimize disease incidence: A mixed integer programming model and analysis of a Bangladesh scenario publication-title: Vaccine doi: 10.1016/j.vaccine.2015.09.088 – volume: 11 start-page: 4991 issue: 8 year: 2011 end-page: 4996 ident: CR35 article-title: Simplified multi-objective genetic algorithms for stochastic job shop scheduling publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2011.06.001 – volume: 129 start-page: 417 year: 2019 end-page: 425 ident: CR10 article-title: Admission control in queue-time loop production-mixed integer programming with Lagrangian relaxation (MIPLAR) publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2019.02.002 – volume: 537 start-page: 320 year: 2016 end-page: 327 ident: CR1 article-title: The coming of age of de novo protein design publication-title: Nature doi: 10.1038/nature19946 – volume: 76 start-page: 147 issue: 2 year: 2002 end-page: 157 ident: CR34 article-title: Optimal job-shop scheduling with random operations and cost objectives publication-title: Int. J. Prod. Econ. doi: 10.1016/S0925-5273(01)00140-2 – volume: 207 start-page: 644 issue: 2 year: 2010 end-page: 655 ident: CR13 article-title: MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: A benchmark scheduling problem of the pharmaceutical industry publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2010.06.002 – volume: 20 start-page: 2383 issue: 6 year: 2016 end-page: 2391 ident: CR37 article-title: Chance-constrained model for uncertain job shop scheduling problem publication-title: Soft Comput. doi: 10.1007/s00500-015-1647-z – volume: 16 start-page: 531 issue: 2 year: 2019 end-page: 541 ident: CR28 article-title: A scalable solution methodology for mixed-integer linear programming problems arising in automation publication-title: IEEE Trans. Autom. Sci. Eng. doi: 10.1109/TASE.2018.2835298 – volume: 9 start-page: 1 issue: 1 year: 1993 end-page: 13 ident: CR29 article-title: A practical approach to job shop scheduling problems publication-title: IEEE Trans. Robot. Autom. doi: 10.1109/70.210791 – volume: 85 start-page: 207 year: 1999 end-page: 211 ident: CR24 article-title: Convergence of a simple subgradient level method publication-title: Math. Program. doi: 10.1007/s101070050053 – volume: 47 start-page: 9659 year: 2022 end-page: 9671 ident: CR39 article-title: Apply ordinal optimization to optimize the job-shop scheduling under uncertain processing times publication-title: Arab. J. Sci. Eng. doi: 10.1007/s13369-021-06317-9 – year: 2022 ident: CR41 article-title: A simulation-based integrated virtual testbed for dynamic optimization in smart manufacturing systems publication-title: J. Adv. Manuf. Process. doi: 10.1002/amp2.10141 – year: 2022 ident: CR11 article-title: MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2022.105862 – year: 2001 ident: CR27 article-title: Convergence rate of incremental subgradient Algorithms publication-title: Stochastic Optimization: Algorithms and Applications – volume: 151 start-page: 107346 year: 2021 ident: CR16 article-title: Production scheduling for the reconfigurable modular pharmaceutical manufacturing processes publication-title: Comput. Chem. Eng. doi: 10.1016/j.compchemeng.2021.107346 – ident: CR42 – volume: 69 start-page: 1468 issue: 5 year: 2021 end-page: 1486 ident: CR7 article-title: Placement optimization in refugee resettlement publication-title: Oper. Res. doi: 10.1287/opre.2020.2093 – volume: 21 start-page: 376 issue: 3 year: 2018 end-page: 392 ident: CR3 article-title: Two-MILP models for scheduling elective surgeries within a private healthcare facility publication-title: Health Care Manag. Sci. doi: 10.1007/s10729-016-9390-2 – volume: 215 start-page: 383 issue: 2 year: 2011 end-page: 392 ident: CR14 article-title: Discrete and continuous time representations and mathematical models for large production scheduling problems: A case study from the pharmaceutical industry publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2011.06.021 – volume: 13 start-page: 1448 issue: 3 year: 2013 end-page: 1458 ident: CR36 article-title: A hybrid differential evolution algorithm for job shop scheduling problems with expected total tardiness criterion publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2012.02.024 – volume: 134 start-page: 101764 year: 2020 ident: CR6 article-title: Robust design of blood supply chains under risk of disruptions using Lagrangian relaxation publication-title: Transp. Res. Part E Logist. Transp. Rev. doi: 10.1016/j.tre.2019.08.005 – volume: 17 start-page: 261 issue: 3 year: 2019 end-page: 295 ident: CR33 article-title: Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem publication-title: 4OR Q. J. Oper. Res. doi: 10.1007/s10288-018-0389-z – volume: 118 start-page: 190 year: 2018 end-page: 207 ident: CR15 article-title: Design and analysis of a satellite network with direct delivery in the pharmaceutical industry publication-title: Transp. Res. Part E Logist. Transp. Rev. doi: 10.1016/j.tre.2018.06.005 – year: 2022 ident: CR21 article-title: Multi-period green reverse logistics network design: An improved Benders-decomposition-based heuristic approach publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2022.03.014 – volume: 9 start-page: 14 issue: 3 year: 1969 end-page: 29 ident: CR22 article-title: Minimization of unsmooth functionals publication-title: USSR Comput. Math. Math. Phys. doi: 10.1016/0041-5553(69)90061-5 – volume: 52 start-page: 629 issue: 3 year: 2012 end-page: 644 ident: CR31 article-title: An exact method with variable fixing for solving the generalized assignment problem publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-011-9432-0 – volume: 2 start-page: 1 issue: 6 year: 2017 end-page: 6 ident: CR17 article-title: Start-up costs of thermal power plants in markets with increasing shares of variable renewable generation publication-title: Nat. Energy doi: 10.1038/nenergy.2017.50 – volume: 78 start-page: 28 year: 2019 end-page: 36 ident: CR38 article-title: Job shop scheduling with consideration of floating breaking times under uncertainty publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2018.10.007 – year: 2022 ident: CR40 article-title: Multi-objective optimization for cost-efficient and resilient machining under tool wear publication-title: J. Adv. Manuf. Process. doi: 10.1002/amp2.10140 – volume: 299 start-page: 1 issue: 1 year: 2022 end-page: 20 ident: CR20 article-title: Optimization in multimodal freight transportation problems: A survey publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2021.07.031 – ident: CR32 – volume: 152 start-page: 102371 year: 2021 ident: CR8 article-title: A robust integrated logistics model for age-based multi-group platelets in disaster relief operations publication-title: Transp. Res. Part E Logist. Transp. Rev. doi: 10.1016/j.tre.2021.102371 – volume: 138 start-page: 105616 year: 2022 ident: CR12 article-title: Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2021.105616 – volume: 18 start-page: 1191 issue: 3 year: 2020 end-page: 1205 ident: CR30 article-title: Distributed and asynchronous coordination of a mixed-integer linear system via surrogate Lagrangian relaxation publication-title: IEEE Trans. Autom. Sci. Eng. doi: 10.1109/TASE.2020.2998048 – volume: 32 start-page: 781 issue: 2 year: 2021 end-page: 797 ident: CR9 article-title: Mathematical modeling and a hybrid evolutionary algorithm for process planning publication-title: J. Intell. Manuf. doi: 10.1007/s10845-020-01703-w – volume: 164 start-page: 173 issue: 1 year: 2015 end-page: 201 ident: CR26 article-title: Convergence of the surrogate Lagrangian relaxation method publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-014-0561-3 – volume: 59 start-page: 309 issue: 2 year: 2021 end-page: 332 ident: CR4 article-title: A new model for operating room scheduling with elective patient strategy publication-title: INFOR Inf. Syst. Oper. Res. doi: 10.1080/03155986.2021.1881359 – volume: 36 start-page: 292 issue: 1 year: 2020 end-page: 302 ident: CR18 article-title: A high performance computing based market economics driven neighborhood search and polishing algorithm for security constrained unit commitment publication-title: IEEE Trans. Power Syst. doi: 10.1109/TPWRS.2020.3005407 – volume: 537 start-page: 320 year: 2016 ident: 26264_CR1 publication-title: Nature doi: 10.1038/nature19946 – volume: 16 start-page: 531 issue: 2 year: 2019 ident: 26264_CR28 publication-title: IEEE Trans. Autom. Sci. Eng. doi: 10.1109/TASE.2018.2835298 – volume: 134 start-page: 101764 year: 2020 ident: 26264_CR6 publication-title: Transp. Res. Part E Logist. Transp. Rev. doi: 10.1016/j.tre.2019.08.005 – volume: 33 start-page: 6218 issue: 46 year: 2015 ident: 26264_CR5 publication-title: Vaccine doi: 10.1016/j.vaccine.2015.09.088 – volume-title: Stochastic Optimization: Algorithms and Applications year: 2001 ident: 26264_CR27 – volume: 152 start-page: 102371 year: 2021 ident: 26264_CR8 publication-title: Transp. Res. Part E Logist. Transp. Rev. doi: 10.1016/j.tre.2021.102371 – volume: 9 start-page: 1 issue: 1 year: 1993 ident: 26264_CR29 publication-title: IEEE Trans. Robot. Autom. doi: 10.1109/70.210791 – volume: 207 start-page: 644 issue: 2 year: 2010 ident: 26264_CR13 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2010.06.002 – volume: 13 start-page: 1448 issue: 3 year: 2013 ident: 26264_CR36 publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2012.02.024 – volume: 69 start-page: 1468 issue: 5 year: 2021 ident: 26264_CR7 publication-title: Oper. Res. doi: 10.1287/opre.2020.2093 – volume: 215 start-page: 383 issue: 2 year: 2011 ident: 26264_CR14 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2011.06.021 – volume: 2 start-page: 1 issue: 6 year: 2017 ident: 26264_CR17 publication-title: Nat. Energy doi: 10.1038/nenergy.2017.50 – volume: 85 start-page: 207 year: 1999 ident: 26264_CR24 publication-title: Math. Program. doi: 10.1007/s101070050053 – volume: 47 start-page: 9659 year: 2022 ident: 26264_CR39 publication-title: Arab. J. Sci. Eng. doi: 10.1007/s13369-021-06317-9 – volume: 12 start-page: 109 issue: 1 year: 2001 ident: 26264_CR25 publication-title: SIAM J. Optim. doi: 10.1137/S1052623499362111 – year: 2022 ident: 26264_CR40 publication-title: J. Adv. Manuf. Process. doi: 10.1002/amp2.10140 – volume: 59 start-page: 309 issue: 2 year: 2021 ident: 26264_CR4 publication-title: INFOR Inf. Syst. Oper. Res. doi: 10.1080/03155986.2021.1881359 – volume: 32 start-page: 781 issue: 2 year: 2021 ident: 26264_CR9 publication-title: J. Intell. Manuf. doi: 10.1007/s10845-020-01703-w – volume: 100 start-page: 699 issue: 3 year: 1999 ident: 26264_CR23 publication-title: J. Optim. Theory Appl. doi: 10.1023/A:1022646725208 – volume: 14 start-page: 2968 issue: 15 year: 2020 ident: 26264_CR19 publication-title: IET Gener. Transm. Distrib. doi: 10.1049/iet-gtd.2018.6314 – volume: 18 start-page: 1191 issue: 3 year: 2020 ident: 26264_CR30 publication-title: IEEE Trans. Autom. Sci. Eng. doi: 10.1109/TASE.2020.2998048 – year: 2022 ident: 26264_CR41 publication-title: J. Adv. Manuf. Process. doi: 10.1002/amp2.10141 – volume: 151 start-page: 107346 year: 2021 ident: 26264_CR16 publication-title: Comput. Chem. Eng. doi: 10.1016/j.compchemeng.2021.107346 – ident: 26264_CR42 – volume: 118 start-page: 190 year: 2018 ident: 26264_CR15 publication-title: Transp. Res. Part E Logist. Transp. Rev. doi: 10.1016/j.tre.2018.06.005 – volume: 11 start-page: 4991 issue: 8 year: 2011 ident: 26264_CR35 publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2011.06.001 – volume: 78 start-page: 28 year: 2019 ident: 26264_CR38 publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2018.10.007 – year: 2022 ident: 26264_CR11 publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2022.105862 – volume: 17 start-page: 261 issue: 3 year: 2019 ident: 26264_CR33 publication-title: 4OR Q. J. Oper. Res. doi: 10.1007/s10288-018-0389-z – ident: 26264_CR32 – volume: 1 start-page: 79 year: 2021 ident: 26264_CR2 publication-title: Nat. Comput. Sci. doi: 10.1038/s43588-020-00009-4 – volume: 52 start-page: 629 issue: 3 year: 2012 ident: 26264_CR31 publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-011-9432-0 – volume: 20 start-page: 2383 issue: 6 year: 2016 ident: 26264_CR37 publication-title: Soft Comput. doi: 10.1007/s00500-015-1647-z – volume: 129 start-page: 417 year: 2019 ident: 26264_CR10 publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2019.02.002 – volume: 36 start-page: 292 issue: 1 year: 2020 ident: 26264_CR18 publication-title: IEEE Trans. Power Syst. doi: 10.1109/TPWRS.2020.3005407 – volume: 299 start-page: 1 issue: 1 year: 2022 ident: 26264_CR20 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2021.07.031 – volume: 76 start-page: 147 issue: 2 year: 2002 ident: 26264_CR34 publication-title: Int. J. Prod. Econ. doi: 10.1016/S0925-5273(01)00140-2 – volume: 138 start-page: 105616 year: 2022 ident: 26264_CR12 publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2021.105616 – year: 2022 ident: 26264_CR21 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2022.03.014 – volume: 9 start-page: 14 issue: 3 year: 1969 ident: 26264_CR22 publication-title: USSR Comput. Math. Math. Phys. doi: 10.1016/0041-5553(69)90061-5 – volume: 21 start-page: 376 issue: 3 year: 2018 ident: 26264_CR3 publication-title: Health Care Manag. Sci. doi: 10.1007/s10729-016-9390-2 – volume: 164 start-page: 173 issue: 1 year: 2015 ident: 26264_CR26 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-014-0561-3 – reference: 36859563 - Sci Rep. 2023 Mar 1;13(1):3474. doi: 10.1038/s41598-023-30358-9 |
| SSID | ssj0000529419 |
| Score | 2.4487817 |
| Snippet | Mixed-Integer Linear Programming (MILP) plays an important role across a range of scientific disciplines and within areas of strategic importance to society.... Abstract Mixed-Integer Linear Programming (MILP) plays an important role across a range of scientific disciplines and within areas of strategic importance to... |
| SourceID | doaj unpaywall pubmedcentral proquest pubmed crossref springer |
| SourceType | Open Website Open Access Repository Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 22417 |
| SubjectTerms | 639/166 639/705 692/700 Computer applications Decomposition Humanities and Social Sciences Integer programming Linear programming multidisciplinary Programming, Linear Science Science (multidisciplinary) |
| SummonAdditionalLinks | – databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3LbhMxFLVQJQQsEG8GCjISO2p1_MrYS4qoKlSxgaLuLD9LpXRSTRPR7voh8HP9Eq49kyERqLBgGzuR597jnOPx9TFCr1PgyfmkCIDHEZF8Q1xwkQC6JNAbwMoVt8-Pk70D8eFQHq5c9ZVrwnp74D5w203KmptbQYMSMSidskN4Sr4OgSZWzLZrpVcWU72rN9OC6uGUTM3V9hkwVT5NBmsvBj8oCF1jomLY_yeV-Xux5LhjegfdWrSn9uKbnU5XSGn3Hro7qEn8tn-K--hGbB-gm_39khcP0ZdPi66b5Rdl-Ory-36uDyI7QFvh6vIH3rdHwFNHAA-cK-LOS4owaFh8cnweAylGErHDWYfaDg-FXCcwpkfoYPf953d7ZLhIgXgQZHMSJ0BJwYaklY9SJgaiyEUIpGaJRSeaZKXM1n0xSF_bOniRpJbMR-UbSB1_jDbaWRufIhyppcB5nsG6SvColHZUTUC0MQh5sLxCdBlU4weX8XzZxdSU3W6uTJ8IA4kwJRGGVujN-J3T3mPj2t47OVdjz-yPXT4A1JgBNeZvqKnQ5jLTZpi0Z4Y1WY1RYPUKvRqbYbrlPRTbxtmi9NHlQDGr0JMeGONIeN7EgqYKNWuQWRvqekt7_LVYemv4W1Qcnm1rCa5fw7ouFFsjAP8hcs_-R-Seo9ssTyKaT3Vtoo15t4gvQJfN3csyBX8CX4kzcA priority: 102 providerName: Directory of Open Access Journals – databaseName: ProQuest Central dbid: BENPR link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lb9QwEB6VrRBwQLwKgYKCxI1aXTvJxjkgxKJWFapWCCjqLXL8WCptkyXdFe2tPwT-XH8JM86jrEArrrEj2Z7PnrFn5huAV85ErtBOMgRPwWKnU1aYwjJEV4LqDWFVeLbPyejgKP5wnBxvwKTLhaGwyu5M9Ae1qTS9ke-KlFQlxyP37fw7o6pR5F3tSmiotrSCeeMpxm7ApiBmrAFsjvcmHz_1ry7k14p51mbPDCO5e4YajLLM8E4m0LiPGV_RUJ7I_1_W599BlL0n9Q7cWpZzdfFDzWZ_KKv9e3C3tTLDdw0s7sOGLR_Azabu5MVD-Pp5WdcVPaCFV5c_DyluiI1RnZmry1_hoZqi_poibEKKlDv3ogvRtg1PT86tYZ5gwtYh2aeqDtsAr1Mc0yM42t_78v6AtQUWmEZDbcHsCFWVUcZlUtskcQKNpcI6vDELJ2wRp04lCVH6WZPooRoaHbskS4S2Uqco0mgLBmVV2icQWq446kIt8L4VR1bKrOASxUV5vMKoKADeLWquW_ZxKoIxy70XPJJ5I4gcBZF7QeQ8gNf9P_OGe2Nt7zHJqu9JvNn-Q1VP83Yb5qmjG1ykYm4kzkpmjvjmndNDY7gTowC2O0nn7WY-y6-hF8DLvhm3IflWVGmrpe-T-URjEcDjBhj9SCJybmFTAOkKZFaGutpSnnzzVN8ZHpcywrntdOC6Hta6pdjpAfgfK_d0_aSfwW1B24NTHtc2DBb10j5HS2xRvGi312_oLzE5 priority: 102 providerName: ProQuest – databaseName: HAS SpringerNature Open Access 2022 dbid: AAJSJ link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NT9wwEB2hRVXbQ9XvpoUqlXrrWl078cY5LhUIrVAvlIqb5U-KtGRR2FXhxg-BP8cv6djJpkQg1F7XduR43uw8ZzzPAJ-9zbw2XhAEjya5NwXRVjuC6OIY3hBWOqp9fh_vHuTTQ364BsNVLUwvfx-lu88wxIQyMNw0MWTfOcG9zrpAYIoBrE8m0_1p900lZK1yWra1MTj8693BvfgTZfrv45Z3j0h2edKn8HhZnaqL32o2uxWKdp7Ds5ZDppPG6C9gzVUv4VFzq-TFK_i5v6zrefg8lt5cXu2FU0FkC4OVvbm8TvfUEUanIwRFGs7BnUfDpMhc05Pjc2dJlI9wdRrYp6rT9vjWCc7pNRzsbP_4tkva6xOIQRq2IG6Mgcgq60thHOeeIRXSzuN-mHnmdF54xXkQ7HOWm5EaWZN7XnJmnDAFGix7A4NqXrl3kDqqKEY6w3A3lWdOiFJTMUaqxnDJrcoSoKtFlabVFg9XXMxkzHFnQjaGkGgIGQ0haQJfujGnjbLGg723gq26nkEVO_6AYJGtk8nCh_1ZpnJqBb6VKH1Qk_fejKylno0T2FhZWraueiZZETgYxViewKeuGZ0sZE5U5ebL2KeMZcQsgbcNMLqZZCF1hU0JFD3I9Kbab6mOf0Uh7xL_DEWG7zZcgevvtB5aimEHwH9Yuff_9_QP8IQFd6GhamsDBot66TaRdy30x9bd_gBxHyVw priority: 102 providerName: Springer Nature – databaseName: Unpaywall dbid: UNPAY link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3bbtQwEB2VrRDlgXshUFCQeKMuiRMnzmOLqCpUVUiwUJ4sx5elYput0o1oeeqHwM_1Sxg7F1ioKvoaTySPfeI5jmeOAV5YndhSWU4QPCVJrcpJqUtDEF0MwxvCqvRqn3vZzjh9u8_2lyDra2F80r6XtPTLdJ8d9uoYA40rBsOtE0UOnhJcYbS9BssZQw4-guXx3rvNz-4mOeQoBGkC7SpkooRf8PJCFPJi_RcxzH8TJYfT0ptwo6mO5Ok3OZ3-EZC2b8On3pU2D-XrRjMvN9T3v1Qer-7rHbjVcdRws7W8C0umugfX21srT-_Dx_dNXc_c77fw_OzHrss6IlsYDPX52c9wV04w-k0QdKHLszvxEx8iMw4PD06MJl6ewtShY7eyDrv0sEP09gGMt998eL1DuusZiEKaNycmw0CnpbYFV4YxS5Fqlcbifptaaso0t5IxJwhoNFORjLRKLSsYVYarHAGRrMKomlXmEYQmljFGUkVxt5YmhvOijHmGVJBGjGqZBBD30yVUp13urtCYCn-GnnDRjpnAMRN-zEQcwMvhnaNWueNS6y2HgsHSqW77B7N6IrqZEbl1-79EprHm6BUvrFOrt1ZFWseWZgGs9RgS3VJwLGjuOF6MXCGA50MzfsTuZEZWZtZ4m8KXKdMAHraQG3qSuKMxbAogXwDjQlcXW6qDL14ovMDFlifo23oP29_dumwo1gdo_8fIPb6a-RNYoQ7ZsasKW4PRvG7MU-R18_JZ9xH_AqDkR_s priority: 102 providerName: Unpaywall |
| Title | Surrogate “Level-Based” Lagrangian Relaxation for mixed-integer linear programming |
| URI | https://link.springer.com/article/10.1038/s41598-022-26264-1 https://www.ncbi.nlm.nih.gov/pubmed/36575204 https://www.proquest.com/docview/2758461130 https://www.proquest.com/docview/2759002042 https://pubmed.ncbi.nlm.nih.gov/PMC9794831 https://www.nature.com/articles/s41598-022-26264-1.pdf https://doaj.org/article/7f86263a41d84ed89f4610ffc0dd1f26 |
| UnpaywallVersion | publishedVersion |
| Volume | 12 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVFSB databaseName: Free Full-Text Journals in Chemistry customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: HH5 dateStart: 20110101 isFulltext: true titleUrlDefault: http://abc-chemistry.org/ providerName: ABC ChemistRy – providerCode: PRVAFT databaseName: Open Access Digital Library customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: KQ8 dateStart: 20110101 isFulltext: true titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html providerName: Colorado Alliance of Research Libraries – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: DOA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVEBS databaseName: EBSCOhost Academic Search Ultimate customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn eissn: 2045-2322 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: ABDBF dateStart: 20121221 isFulltext: true titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn providerName: EBSCOhost – providerCode: PRVBFR databaseName: Free Medical Journals customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: DIK dateStart: 20110101 isFulltext: true titleUrlDefault: http://www.freemedicaljournals.com providerName: Flying Publisher – providerCode: PRVFQY databaseName: GFMER Free Medical Journals customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: GX1 dateStart: 0 isFulltext: true titleUrlDefault: http://www.gfmer.ch/Medical_journals/Free_medical.php providerName: Geneva Foundation for Medical Education and Research – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: M~E dateStart: 20110101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVAQN databaseName: PubMed Central customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: RPM dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.ncbi.nlm.nih.gov/pmc/ providerName: National Library of Medicine – providerCode: PRVAQT databaseName: Springer Nature - nature.com Journals - Fully Open Access customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: NAO dateStart: 20111201 isFulltext: true titleUrlDefault: https://www.nature.com/siteindex/index.html providerName: Nature Publishing – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: http://www.proquest.com/pqcentral?accountid=15518 eissn: 2045-2322 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: BENPR dateStart: 20210101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central Health & Medical Collection (via ProQuest) customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: 7X7 dateStart: 20210101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVFZP databaseName: Scholars Portal Journals Open Access customDbUrl: eissn: 2045-2322 dateEnd: 20250131 omitProxy: true ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: M48 dateStart: 20110801 isFulltext: true titleUrlDefault: http://journals.scholarsportal.info providerName: Scholars Portal – providerCode: PRVAVX databaseName: HAS SpringerNature Open Access 2022 customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: AAJSJ dateStart: 20111201 isFulltext: true titleUrlDefault: https://www.springernature.com providerName: Springer Nature – providerCode: PRVAVX databaseName: Springer Nature OA Free Journals customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: C6C dateStart: 20111201 isFulltext: true titleUrlDefault: http://www.springeropen.com/ providerName: Springer Nature |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9NAEB6VVkA5IJ7FUCIjcaOG7Pq1PiCURK2qqEQVJSicrPU-QqXUad1EJLf-EPhz_SXMrh8QEVWIkyXvWlrPfOP5xrszA_BaS19nQjMPwZN5gRaxl8lMeYiuEN0bwiqz1T4H0eEw6I_C0QbU7Y4qAV6uDe1MP6lhMXm7uFh-QIN_X6aMs3eX6IRMohiGVRT5eeBhNLSFnioxrRw-VnS_rPVNk4AkVe7M-ke34Y5vNiNo1bqtdlW2ov86Gvr3acpmS_Ue3J3n53z5nU8mf3itgwdwv6KbbqfEx0PYUPkjuF02oFw-hi8n86KYmj9p7vXVjyNzgMjrol-T11c_3SM-Rkc2Rvy45sjcwurQRZLrnp0ulPRspQlVuIao8sKtTnqd4ZqewPBg_3Pv0Ks6LXgCGdvMUxH6LMmlTphQYagpsqZMaQydqaYqC2LNw9DU9lMyFG3eliLQYRJSoZiIUbf-U9jMp7l6Bq4inKBTFBQDr8BXjCUZYRGyOorSl9x3gNRCTUVVhtx0w5ikdjvcZ2mpkxR1klqdpMSBN80z52URjhtnd42umpmmgLa9MS3GaWWPaaxNKOfzgEiGb8USbQrPay3aUhJNIwd2a02nNShTGhu6RtDtO_CqGUZ7NJssPFfTuZ2T2Ixj6sBOCYxmJTWwHIhXILOy1NWR_PSbrfmd4HeT-fhuezW4fi_rJlHsNQD8B8k9_-91vYBtaoyImFyvXdicFXP1EtnaLGvBrXgUt2Cr0-mf9PHa3R8cf8K7vajXsn9AWtZIcWQ4OO58_QUHBULS |
| linkProvider | Scholars Portal |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLbGJjR4QNwXGBAkeGLWaidpnIcJUdjUsVIh2Ka9BceXblKXlrTV1rf9EPgr_Jj9Es5xk4wKVPGy19qpbJ_P5-JzI-SV1YHNlBUUwJPR0KqYZjozFNAVgXgDWGWu2me32T4IPx5FR0vkV5ULg2GVFU90jFoPFL6Rb_IYRSUDlvt2-J1i1yj0rlYtNGTZWkFvuRJjZWLHnpmegQk32tr9APR-zfnO9v77Ni27DFAF2sqYmibway21TYQyUWQ5aAyZsWA2cstNFsZWRhHWtTM6Ug3Z0Cq0URJxZYSKYV8B_O8NshIGYQLG30pru_v5S_3Kg360kCVltk4jEJsjkJiY1QY2IAdjIqRsTiK6xgH_0nb_DtqsPbe3yeokH8rpmez3_xCOO3fJnVKr9d_NYHiPLJn8Prk563M5fUAOv06KYoAPdv7lxY8OxinRFohPfXnx0-_IHsjLHsDUx8i8cwcVH3Rp__Tk3GjqClqYwkd9WBZ-GVB2Cmt6SA6u5agfkeV8kJs14hsmGchexcG-CwMjRJIxAfDAvGGuZeARVh1qqspq59h0o586r3sg0hkhUiBE6giRMo-8qb8Zzmp9LJzdQlrVM7FOt_thUPTS8tqnsUWLMZAh0wJ2JRKL9e2tVQ2tmeVNj6xXlE5L5jFKr6DukZf1MFx79OXI3Awmbk7iEpu5Rx7PgFGvJEBnGgx5JJ6DzNxS50fyk2NXWjwB9iwC2NtGBa6rZS06io0agP9xck8Wb_oFWW3vf-qknd3u3lNyi-NVYZhDtk6Wx8XEPAMtcJw9L6-aT75d9-3-Dc7_cAM |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLbGELcHxJ3AgCDBE7NaO0njPCDEGNXGqgkJhvpmEl_KpC4paautb_sh8Ef4OfslnONcRgWqeNlr7VS2z3du9rkQ8sLqwGbKCgrgyWhoVUwznRkK6IpAvQGsMlftc7-3cxB-GEbDNfKryYXBsMpGJjpBrQuFd-QdHqOqZCByO7YOi_i43X8z-U6xgxS-tDbtNCqI7JnFMbhv09e720Drl5z3339-t0PrDgNUgaUyo6YHslqn2iZCmSiyHKyFzFhwGbnlJgtjm0YR1rQzOlLdtKtVaKMk4soIFcOeAvjfS-RyHAQJhhPGw7i938EXtJAldZ5ONxCdKehKzGcD74-DGxFStqQLXcuAf9m5f4drtm-2N8i1eT5JF8fpePyHWuzfIjdre9Z_WwHwNlkz-R1ypepwubhLvnyal2WBV3X-2emPAUYo0S1QnPrs9Kc_SEegKUcAUB9j8k4cSHywov2jwxOjqStlYUofLeG09OtQsiNY0z1ycCEHfZ-s50VuHhLfsJSB1lUcPLswMEIkGRMADMwY5joNPMKaQ5WqrnOO7TbG0r23B0JWhJBACOkIIZlHXrXfTKoqHytnbyGt2plYodv9UJQjWTO8jC36ikEaMi1gVyKxWNneWtXVmlne88hGQ2lZi42pPAe5R563w8Dw-IqT5qaYuzmJS2nmHnlQAaNdSYDPaDDkkXgJMktLXR7JD7-5ouIJCGYRwN42G3CdL2vVUWy2APyPk3u0etPPyFXgaTnY3d97TK5z5BSGyWMbZH1Wzs0TMP9m2VPHZz75etGM_Ru9Q22d |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3bbtQwEB2VrRDlgXshUFCQeKMuiRMnzmOLqCpUVUiwUJ4sx5elYput0o1oeeqHwM_1Sxg7F1ioKvoaTySPfeI5jmeOAV5YndhSWU4QPCVJrcpJqUtDEF0MwxvCqvRqn3vZzjh9u8_2lyDra2F80r6XtPTLdJ8d9uoYA40rBsOtE0UOnhJcYbS9BssZQw4-guXx3rvNz-4mOeQoBGkC7SpkooRf8PJCFPJi_RcxzH8TJYfT0ptwo6mO5Ok3OZ3-EZC2b8On3pU2D-XrRjMvN9T3v1Qer-7rHbjVcdRws7W8C0umugfX21srT-_Dx_dNXc_c77fw_OzHrss6IlsYDPX52c9wV04w-k0QdKHLszvxEx8iMw4PD06MJl6ewtShY7eyDrv0sEP09gGMt998eL1DuusZiEKaNycmw0CnpbYFV4YxS5Fqlcbifptaaso0t5IxJwhoNFORjLRKLSsYVYarHAGRrMKomlXmEYQmljFGUkVxt5YmhvOijHmGVJBGjGqZBBD30yVUp13urtCYCn-GnnDRjpnAMRN-zEQcwMvhnaNWueNS6y2HgsHSqW77B7N6IrqZEbl1-79EprHm6BUvrFOrt1ZFWseWZgGs9RgS3VJwLGjuOF6MXCGA50MzfsTuZEZWZtZ4m8KXKdMAHraQG3qSuKMxbAogXwDjQlcXW6qDL14ovMDFlifo23oP29_dumwo1gdo_8fIPb6a-RNYoQ7ZsasKW4PRvG7MU-R18_JZ9xH_AqDkR_s |
| 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=Surrogate+%E2%80%9CLevel-Based%E2%80%9D+Lagrangian+Relaxation+for+mixed-integer+linear+programming&rft.jtitle=Scientific+reports&rft.au=Bragin%2C+Mikhail+A.&rft.au=Tucker%2C+Emily+L.&rft.date=2022-12-27&rft.pub=Nature+Publishing+Group+UK&rft.eissn=2045-2322&rft.volume=12&rft_id=info:doi/10.1038%2Fs41598-022-26264-1&rft_id=info%3Apmid%2F36575204&rft.externalDocID=PMC9794831 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2045-2322&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2045-2322&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2045-2322&client=summon |