Integrality gap minimization heuristics for binary mixed integer nonlinear programming
We present two feasibility heuristics for binary mixed integer nonlinear programming. Called integrality gap minimization algorithm (IGMA)—versions 1 and 2, our heuristics are based on the solution of integrality gap minimization problems with a space partitioning scheme defined over the integer var...
Uložené v:
| Vydané v: | Journal of global optimization Ročník 71; číslo 3; s. 593 - 612 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
Springer US
01.07.2018
Springer Springer Nature B.V |
| Predmet: | |
| ISSN: | 0925-5001, 1573-2916 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | We present two feasibility heuristics for binary mixed integer nonlinear programming. Called integrality gap minimization algorithm (IGMA)—versions 1 and 2, our heuristics are based on the solution of integrality gap minimization problems with a space partitioning scheme defined over the integer variables of the problem addressed. Computational results on a set of benchmark instances show that the proposed approaches present satisfactory results. |
|---|---|
| AbstractList | We present two feasibility heuristics for binary mixed integer nonlinear programming. Called integrality gap minimization algorithm (IGMA)-versions 1 and 2, our heuristics are based on the solution of integrality gap minimization problems with a space partitioning scheme defined over the integer variables of the problem addressed. Computational results on a set of benchmark instances show that the proposed approaches present satisfactory results. |
| Audience | Academic |
| Author | Raupp, Fernanda Melo, Wendel Fampa, Marcia |
| Author_xml | – sequence: 1 givenname: Wendel orcidid: 0000-0002-0586-9157 surname: Melo fullname: Melo, Wendel email: wendelmelo@ufu.br organization: College of Computer Science, Federal University of Uberlandia – sequence: 2 givenname: Marcia surname: Fampa fullname: Fampa, Marcia organization: Institute of Mathematics and COPPE, Federal University of Rio de Janeiro – sequence: 3 givenname: Fernanda surname: Raupp fullname: Raupp, Fernanda organization: National Laboratory for Scientific Computing (LNCC) of the Ministry of Science, Technology and Innovation |
| BookMark | eNp9kE1LxDAQhoMouH78AG8Fz9XJtGmTo4gfC4IX9RrSNF0jbbomXVB_vbNWEAQlhECYZ96Z54DthjE4xk44nHGA-jxxkErmwOlWWOTlDltwURc5Kl7tsgUoFLkA4PvsIKUXAFBS4II9LcPkVtH0fnrPVmadDT74wX-YyY8he3ab6NPkbcq6MWaNDya-U8mbazO_BV3MaJDeB2dito4jdRqow-qI7XWmT-74-z1kj9dXD5e3-d39zfLy4i63hRBT3oqat1KANEUHbdNUAGga2ZRl3ZUlKkRhJBZVjW1VcIGFcrVxrrMWrQKHxSE7nftS9uvGpUm_jJsYKFIjQFVVKBVQ1dlctTK90z504xSNpdO6wVsS2Xn6v6i5LJErIQjgM2DjmFJ0nV5HP9DumoPe-tazb02-9da3LompfzHWT18aKcz3_5I4k4lSAjn9WeJv6BPueJbL |
| CitedBy_id | crossref_primary_10_1007_s11432_020_3139_9 crossref_primary_10_1016_j_iot_2025_101763 crossref_primary_10_1109_JIOT_2024_3464634 crossref_primary_10_1007_s10479_020_03722_5 crossref_primary_10_1016_j_ipl_2018_11_003 crossref_primary_10_1007_s10479_018_2872_5 crossref_primary_10_1007_s10479_021_03998_1 crossref_primary_10_1007_s10898_018_0674_6 crossref_primary_10_1080_03610918_2023_2234683 crossref_primary_10_1109_JIOT_2024_3462899 crossref_primary_10_1137_22M1509862 |
| Cites_doi | 10.1007/BF02592064 10.1002/cite.201400037 10.1007/BF01581153 10.1007/s12532-013-0060-9 10.1007/s10107-004-0518-7 10.1007/s10107-004-0559-y 10.1007/s10589-010-9350-6 10.1109/MELCON.2004.1346858 10.1007/s11081-011-9141-7 10.1088/1742-6596/180/1/012014 10.1287/opre.17.4.680 10.1145/2532568 10.1007/s10107-003-0395-5 10.1287/ijoc.6.4.445 10.1007/s10107-008-0212-2 10.1007/BF00934810 10.1007/978-3-642-83724-1_12 10.1007/978-3-540-68279-0_15 10.1007/s11590-016-1046-0 10.1007/s10107-012-0608-x 10.1007/s10288-011-0181-9 10.1007/s10898-014-0217-8 10.1007/s12532-011-0031-y 10.1007/s11590-013-0623-8 10.1007/s10589-008-9218-1 10.1016/0098-1354(92)80028-8 10.1021/ie800257x 10.1007/s13675-016-0079-6 10.1016/j.disopt.2006.10.001 |
| ContentType | Journal Article |
| Copyright | Springer Science+Business Media, LLC, part of Springer Nature 2018 COPYRIGHT 2018 Springer Journal of Global Optimization is a copyright of Springer, (2018). All Rights Reserved. |
| Copyright_xml | – notice: Springer Science+Business Media, LLC, part of Springer Nature 2018 – notice: COPYRIGHT 2018 Springer – notice: Journal of Global Optimization is a copyright of Springer, (2018). All Rights Reserved. |
| DBID | AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 88I 8AL 8AO 8FD 8FE 8FG 8FK 8FL 8G5 ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- L.- L6V L7M L~C L~D M0C M0N M2O M2P M7S MBDVC P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U |
| DOI | 10.1007/s10898-018-0623-4 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Complete ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Science Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni Edition) Research Library (Alumni Edition) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Health Research Premium Collection ProQuest Central Essentials Local Electronic Collection Information ProQuest Central Business Premium Collection Technology collection ProQuest One Community College ProQuest Central Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student Research Library Prep SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Computing Database Research Library Science Database Engineering Database Research Library (Corporate) ProQuest advanced technologies & aerospace journals ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Business (OCUL) ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering collection ProQuest Central Basic |
| DatabaseTitle | CrossRef ProQuest Business Collection (Alumni Edition) Research Library Prep Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Central (Alumni Edition) ProQuest One Community College Research Library (Alumni Edition) ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Central Korea ProQuest Research Library Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | ProQuest Business Collection (Alumni Edition) |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics Sciences (General) Computer Science |
| EISSN | 1573-2916 |
| EndPage | 612 |
| ExternalDocumentID | A718421955 10_1007_s10898_018_0623_4 |
| GroupedDBID | -52 -57 -5G -BR -EM -Y2 -~C .4S .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 2.D 203 28- 29K 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 7WY 88I 8AO 8FE 8FG 8FL 8G5 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYOK AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYQZM AZFZN AZQEC B-. BA0 BAPOH BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP D-I DDRTE DL5 DNIVK DPUIP DU5 DWQXO EBLON EBS EDO EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GUQSH GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IAO IHE IJ- IKXTQ ITC ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K60 K6V K6~ K7- KDC KOV KOW L6V LAK LLZTM M0C M0N M2O M2P M4Y M7S MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P62 P9M PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SBE SCLPG SDD SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW VH1 W23 W48 WK8 YLTOR Z45 Z5O Z7R Z7X Z7Z Z81 Z83 Z86 Z88 Z8M Z8N Z8T Z8U Z8W Z92 ZMTXR ZWQNP ZY4 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L.- L7M L~C L~D MBDVC PKEHL PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c355t-d571d8508a3f0dbb6002ab8b447f4429225a823672d6315239e7aeefcc2c90e23 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 11 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000435809900010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0925-5001 |
| IngestDate | Tue Nov 04 22:21:33 EST 2025 Sat Nov 29 10:09:47 EST 2025 Tue Nov 18 22:25:29 EST 2025 Sat Nov 29 01:59:34 EST 2025 Fri Feb 21 02:42:30 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Integrality gap minimization Solver Binary mixed integer nonlinear programming Heuristics |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c355t-d571d8508a3f0dbb6002ab8b447f4429225a823672d6315239e7aeefcc2c90e23 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-0586-9157 |
| PQID | 2006662890 |
| PQPubID | 29930 |
| PageCount | 20 |
| ParticipantIDs | proquest_journals_2006662890 gale_infotracacademiconefile_A718421955 crossref_primary_10_1007_s10898_018_0623_4 crossref_citationtrail_10_1007_s10898_018_0623_4 springer_journals_10_1007_s10898_018_0623_4 |
| PublicationCentury | 2000 |
| PublicationDate | 20180700 2018-7-00 20180701 |
| PublicationDateYYYYMMDD | 2018-07-01 |
| PublicationDate_xml | – month: 7 year: 2018 text: 20180700 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York – name: Dordrecht |
| PublicationSubtitle | An International Journal Dealing with Theoretical and Computational Aspects of Seeking Global Optima and Their Applications in Science, Management and Engineering |
| PublicationTitle | Journal of global optimization |
| PublicationTitleAbbrev | J Glob Optim |
| PublicationYear | 2018 |
| Publisher | Springer US Springer Springer Nature B.V |
| Publisher_xml | – name: Springer US – name: Springer – name: Springer Nature B.V |
| References | TrespalaciosFGrossmannIEReview of mixed-integer nonlinear and generalized disjunctive programming methodsChem. Ing. Tech.2014867991101210.1002/cite.201400037 MeloWFampaMRauppFIntegrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programmingJ. Glob. Optim.2014602373389325768910.1007/s10898-014-0217-81312.90046 FletcherRLeyfferSSolving mixed integer nonlinear programs by outer approximationMath. Program.199466327349129707010.1007/BF015811530833.90088 Berthold, T., Gleixner, A.M.: Undercover—a primal heuristic for minlp based on sub-mips generated by set covering. Technical Report ZIB-REPORT 09-04 (2009) GeoffrionAMGeneralized benders decompositionJ. Optim. Theory Appl.19721023726032731010.1007/BF009348100229.90024 Berthold, T.: Heuristic algorithms in global MINLP solvers. Ph.D. thesis, Technische Universität Berlin (2014) RaghavachariMOn connections between zero-one integer programming and concave programming under linear constraintsOper. Res.196917468068424382310.1287/opre.17.4.6800176.49805 D’AmbrosioCFrangioniALibertiLLodiAA storm of feasibility pumps for nonconvex minlpMath. Program.20121362375402300059610.1007/s10107-012-0608-x1257.90056 DuranMGrossmannIAn outer-approximation algorithm for a class of mixed-integer nonlinear programsMath. Program.19863630733986641310.1007/BF025920640619.90052 Mouret, S., Grossmann, I.: Crude-oil operations scheduling. Available from CyberInfrastructure for MINLP at: https://www.minlp.org/library/problem/index.php?i=117 (2010). Accessed 14 Oct 2016 Bonami, P., Kilinç, M., Linderoth, J.: Algorithms and software for convex mixed integer nonlinear programs. Technical Report 1664, Computer Sciences Department, University of Wisconsin-Madison (2009) BragalliCD’AmbrosioCLeeJLodiATothPOn the optimal design of water distribution networks: a practical minlp approachOptim. Eng.201213219246292504010.1007/s11081-011-9141-71293.76045 BonamiPGonçalvesJHeuristics for convex mixed integer nonlinear programsComput. Optim. Appl.20081241.90189 WächterABieglerLTOn the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programmingMath. Program.20061062557219561610.1007/s10107-004-0559-y1134.90542 BertaccoLFischettiMLodiAA feasibility pump heuristic for general mixed-integer problemsDiscrete Optim.2007416376229248510.1016/j.disopt.2006.10.0011169.90415 Fourer, R., Gay, D.M., Kernighan, B.: AMPL: a mathematical programming language. In: Wallace, S.W. (ed.) Algorithms and Model Formulations in Mathematical Programming. Nato Asi Series F, Computer And Systems Sciences, Vol. 51. Springer, New York, NY, pp. 50–151 (1989). MurrayWNgK-MAn algorithm for nonlinear optimization problems with binary variablesComput. Optim. Appl.201047257288271818010.1007/s10589-008-9218-11200.90156 BertholdTRensMath. Program. Comput.2014613354317060310.1007/s12532-013-0060-91304.90147 YouFGrossmannIEMixed-integer nonlinear programming models and algorithms for large-scale supply chain design with stochastic inventory managementIndus. Eng. Chem. Res.200847207802781710.1021/ie800257x LeyfferSLinderothJLuedtkeJMillerAMunsonTApplications and algorithms for mixed integer nonlinear programmingJ. Phys. Conf. Ser.2009180101201410.1088/1742-6596/180/1/012014 BonamiPLeeJLeyfferSWächterAOn branching rules for convex mixed-integer nonlinear optimizationJ. Exp. Algorithmics2013182.6:2.12.6:2.31314181610.1145/25325681322.90052 Gopalakrishnan, A., Biegler, L.: Minlp and MPCC formulations for the cascading tanks problem. Available from CyberInfrastructure for MINLP at: https://www.minlp.org/library/problem/index.php?i=140(2011). Accessed 14 Oct 2016 D’AmbrosioCLodiAMixed integer nonlinear programming tools: a practical overview4OR201194329349286985010.1007/s10288-011-0181-91235.90101 LópezCOBeasleyJEA note on solving minlp’s using formulation space searchOptim. Lett.20148311671182317059510.1007/s11590-013-0623-81292.90213 Science Technology Facilities Council: HSL: A collection of Fortran codes for large scale scientific computation. http://www.hsl.rl.ac.uk/. Accessed 14 Oct 2016 Gentilini, I.: Minlp approach for the TSPN (traveling salesman problem with neighborhoods). Available from CyberInfrastructure for MINLP at: https://www.minlp.org/library/problem/index.php?i=124 (2011). Accessed 14 Oct 2016 Nannicini, G., Belotti, P., Liberti, L.: A local branching heuristic for MINLPs. ArXiv e-prints (2008) Liu, P., Pistikopoulos, E.N., Li, Z.: Global multi-objective optimization of a nonconvex minlp problem and its application on polygeneration energy systems design. Available from CyberInfrastructure for MINLP at: https://www.minlp.org/library/problem/index.php?i=42 (2009). Accessed 14 Oct 2016 Christodoulou, M., Costoulakis, C.: Nonlinear mixed integer programming for aircraft collision avoidance in free flight. In: Proceedings of the 12th IEEE Mediterranean Electrotechnical Conference, 2004. MELECON 2004, vol. 1, pp. 327–330 (2004) Belotti, P.: Design of telecommunication networks with shared protection. Available from CyberInfrastructure for MINLP at: www.minlp.org/library/problem/index.php?i=51 (2009). Accessed 14 Oct 2016 QuesadaIGrossmannIEAn LP/NLP based branch and bound algorithm for convex minlp optimization problemsComput. Chem. Eng.19921610–1193794710.1016/0098-1354(92)80028-8 LibertiLMladenovićNNanniciniGA recipe for finding good solutions to minlpsMath. Program. Comput.20113349390287063610.1007/s12532-011-0031-y1276.90041 BelottiPBertholdTThree ideas for a feasibility pump for nonconvex minlpOptim. Lett.2017111315359892410.1007/s11590-016-1046-01373.90080 FischettiMLodiALocal branchingMath. Program.2003982347201936610.1007/s10107-003-0395-51060.90056 FampaMLeeJMeloWOn global optimization with indefinite quadraticsEURO J. Comput. Optim.20161384.90075 HemmeckeRKöppeMLeeJWeismantelRJüngerMLieblingTMNaddefDNemhauserGLPulleyblankWRReineltGRinaldiGWolseyLANonlinear integer programming50 Years of Integer Programming 1958–20082010BerlinSpringer561618 Dash Optimization. Getting Started with Xpress. http://www.fico.com/xpress. Accessed 14 Oct 2016 DannaERothbergELe PapeCExploring relaxation induced neighborhoods to improve mip solutionsMath. Program.200510217190211548110.1007/s10107-004-0518-71131.90036 Intel Corporation: Intel C++ Compiler 16.0 User and Reference Guide. https://software.intel.com/en-us/intel-cplusplus-compiler-16.0-user-and-reference-guide. Accessed 14 Oct 2016 Guillen, G., Pozo, C.: Optimization of metabolic networks in biotechnology. Available from CyberInfrastructure for MINLP at: https://www.minlp.org/library/problem/index.php?i=81 (2010). Accessed 14 Oct 2016 SavelsberghMWPPreprocessing and probing techniques for mixed integer programming problemsORSA J. Comput.199464445454130015310.1287/ijoc.6.4.4450814.90093 BonamiPCornuéjolsGLodiAMargotFA feasibility pump for mixed integer nonlinear programsMath. Program.2009119331352248700810.1007/s10107-008-0212-21163.90013 GAMS World. Minlp library 2. https://www.gamsworld.org/minlp/minlplib2/html/ (2014). Accessed 14 Oct 2016 623_CR4 623_CR12 623_CR34 W Melo (623_CR33) 2014; 60 623_CR36 623_CR5 P Bonami (623_CR8) 2008 F You (623_CR43) 2008; 47 623_CR16 S Leyffer (623_CR29) 2009; 180 623_CR1 C D’Ambrosio (623_CR14) 2011; 9 C D’Ambrosio (623_CR13) 2012; 136 623_CR31 M Raghavachari (623_CR38) 1969; 17 E Danna (623_CR15) 2005; 102 C Bragalli (623_CR11) 2012; 13 M Duran (623_CR17) 1986; 36 MWP Savelsbergh (623_CR39) 1994; 6 P Belotti (623_CR2) 2017; 11 AM Geoffrion (623_CR24) 1972; 10 P Bonami (623_CR7) 2009; 119 623_CR23 623_CR25 R Fletcher (623_CR20) 1994; 66 623_CR26 A Wächter (623_CR42) 2006; 106 M Fampa (623_CR18) 2016 623_CR28 F Trespalacios (623_CR41) 2014; 86 623_CR40 L Bertacco (623_CR3) 2007; 4 623_CR21 623_CR22 L Liberti (623_CR30) 2011; 3 P Bonami (623_CR10) 2013; 18 CO López (623_CR32) 2014; 8 M Fischetti (623_CR19) 2003; 98 R Hemmecke (623_CR27) 2010 I Quesada (623_CR37) 1992; 16 W Murray (623_CR35) 2010; 47 T Berthold (623_CR6) 2014; 6 623_CR9 |
| References_xml | – reference: LópezCOBeasleyJEA note on solving minlp’s using formulation space searchOptim. Lett.20148311671182317059510.1007/s11590-013-0623-81292.90213 – reference: MurrayWNgK-MAn algorithm for nonlinear optimization problems with binary variablesComput. Optim. Appl.201047257288271818010.1007/s10589-008-9218-11200.90156 – reference: Berthold, T., Gleixner, A.M.: Undercover—a primal heuristic for minlp based on sub-mips generated by set covering. Technical Report ZIB-REPORT 09-04 (2009) – reference: Christodoulou, M., Costoulakis, C.: Nonlinear mixed integer programming for aircraft collision avoidance in free flight. In: Proceedings of the 12th IEEE Mediterranean Electrotechnical Conference, 2004. MELECON 2004, vol. 1, pp. 327–330 (2004) – reference: BertholdTRensMath. Program. Comput.2014613354317060310.1007/s12532-013-0060-91304.90147 – reference: BonamiPGonçalvesJHeuristics for convex mixed integer nonlinear programsComput. Optim. Appl.20081241.90189 – reference: GAMS World. Minlp library 2. https://www.gamsworld.org/minlp/minlplib2/html/ (2014). Accessed 14 Oct 2016 – reference: BelottiPBertholdTThree ideas for a feasibility pump for nonconvex minlpOptim. Lett.2017111315359892410.1007/s11590-016-1046-01373.90080 – reference: DuranMGrossmannIAn outer-approximation algorithm for a class of mixed-integer nonlinear programsMath. Program.19863630733986641310.1007/BF025920640619.90052 – reference: Dash Optimization. Getting Started with Xpress. http://www.fico.com/xpress. Accessed 14 Oct 2016 – reference: Fourer, R., Gay, D.M., Kernighan, B.: AMPL: a mathematical programming language. In: Wallace, S.W. (ed.) Algorithms and Model Formulations in Mathematical Programming. Nato Asi Series F, Computer And Systems Sciences, Vol. 51. Springer, New York, NY, pp. 50–151 (1989). – reference: Liu, P., Pistikopoulos, E.N., Li, Z.: Global multi-objective optimization of a nonconvex minlp problem and its application on polygeneration energy systems design. Available from CyberInfrastructure for MINLP at: https://www.minlp.org/library/problem/index.php?i=42 (2009). Accessed 14 Oct 2016 – reference: Gopalakrishnan, A., Biegler, L.: Minlp and MPCC formulations for the cascading tanks problem. Available from CyberInfrastructure for MINLP at: https://www.minlp.org/library/problem/index.php?i=140(2011). Accessed 14 Oct 2016 – reference: MeloWFampaMRauppFIntegrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programmingJ. Glob. Optim.2014602373389325768910.1007/s10898-014-0217-81312.90046 – reference: WächterABieglerLTOn the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programmingMath. Program.20061062557219561610.1007/s10107-004-0559-y1134.90542 – reference: D’AmbrosioCFrangioniALibertiLLodiAA storm of feasibility pumps for nonconvex minlpMath. Program.20121362375402300059610.1007/s10107-012-0608-x1257.90056 – reference: Intel Corporation: Intel C++ Compiler 16.0 User and Reference Guide. https://software.intel.com/en-us/intel-cplusplus-compiler-16.0-user-and-reference-guide. Accessed 14 Oct 2016 – reference: TrespalaciosFGrossmannIEReview of mixed-integer nonlinear and generalized disjunctive programming methodsChem. Ing. Tech.2014867991101210.1002/cite.201400037 – reference: FischettiMLodiALocal branchingMath. Program.2003982347201936610.1007/s10107-003-0395-51060.90056 – reference: Mouret, S., Grossmann, I.: Crude-oil operations scheduling. Available from CyberInfrastructure for MINLP at: https://www.minlp.org/library/problem/index.php?i=117 (2010). Accessed 14 Oct 2016 – reference: Gentilini, I.: Minlp approach for the TSPN (traveling salesman problem with neighborhoods). Available from CyberInfrastructure for MINLP at: https://www.minlp.org/library/problem/index.php?i=124 (2011). Accessed 14 Oct 2016 – reference: LibertiLMladenovićNNanniciniGA recipe for finding good solutions to minlpsMath. Program. Comput.20113349390287063610.1007/s12532-011-0031-y1276.90041 – reference: BragalliCD’AmbrosioCLeeJLodiATothPOn the optimal design of water distribution networks: a practical minlp approachOptim. Eng.201213219246292504010.1007/s11081-011-9141-71293.76045 – reference: DannaERothbergELe PapeCExploring relaxation induced neighborhoods to improve mip solutionsMath. Program.200510217190211548110.1007/s10107-004-0518-71131.90036 – reference: Science Technology Facilities Council: HSL: A collection of Fortran codes for large scale scientific computation. http://www.hsl.rl.ac.uk/. Accessed 14 Oct 2016 – reference: BertaccoLFischettiMLodiAA feasibility pump heuristic for general mixed-integer problemsDiscrete Optim.2007416376229248510.1016/j.disopt.2006.10.0011169.90415 – reference: RaghavachariMOn connections between zero-one integer programming and concave programming under linear constraintsOper. Res.196917468068424382310.1287/opre.17.4.6800176.49805 – reference: GeoffrionAMGeneralized benders decompositionJ. Optim. Theory Appl.19721023726032731010.1007/BF009348100229.90024 – reference: D’AmbrosioCLodiAMixed integer nonlinear programming tools: a practical overview4OR201194329349286985010.1007/s10288-011-0181-91235.90101 – reference: HemmeckeRKöppeMLeeJWeismantelRJüngerMLieblingTMNaddefDNemhauserGLPulleyblankWRReineltGRinaldiGWolseyLANonlinear integer programming50 Years of Integer Programming 1958–20082010BerlinSpringer561618 – reference: YouFGrossmannIEMixed-integer nonlinear programming models and algorithms for large-scale supply chain design with stochastic inventory managementIndus. Eng. Chem. Res.200847207802781710.1021/ie800257x – reference: SavelsberghMWPPreprocessing and probing techniques for mixed integer programming problemsORSA J. Comput.199464445454130015310.1287/ijoc.6.4.4450814.90093 – reference: LeyfferSLinderothJLuedtkeJMillerAMunsonTApplications and algorithms for mixed integer nonlinear programmingJ. Phys. Conf. Ser.2009180101201410.1088/1742-6596/180/1/012014 – reference: QuesadaIGrossmannIEAn LP/NLP based branch and bound algorithm for convex minlp optimization problemsComput. Chem. Eng.19921610–1193794710.1016/0098-1354(92)80028-8 – reference: Nannicini, G., Belotti, P., Liberti, L.: A local branching heuristic for MINLPs. ArXiv e-prints (2008) – reference: BonamiPLeeJLeyfferSWächterAOn branching rules for convex mixed-integer nonlinear optimizationJ. Exp. Algorithmics2013182.6:2.12.6:2.31314181610.1145/25325681322.90052 – reference: Belotti, P.: Design of telecommunication networks with shared protection. Available from CyberInfrastructure for MINLP at: www.minlp.org/library/problem/index.php?i=51 (2009). Accessed 14 Oct 2016 – reference: BonamiPCornuéjolsGLodiAMargotFA feasibility pump for mixed integer nonlinear programsMath. Program.2009119331352248700810.1007/s10107-008-0212-21163.90013 – reference: Bonami, P., Kilinç, M., Linderoth, J.: Algorithms and software for convex mixed integer nonlinear programs. Technical Report 1664, Computer Sciences Department, University of Wisconsin-Madison (2009) – reference: FampaMLeeJMeloWOn global optimization with indefinite quadraticsEURO J. Comput. Optim.20161384.90075 – reference: Guillen, G., Pozo, C.: Optimization of metabolic networks in biotechnology. Available from CyberInfrastructure for MINLP at: https://www.minlp.org/library/problem/index.php?i=81 (2010). Accessed 14 Oct 2016 – reference: FletcherRLeyfferSSolving mixed integer nonlinear programs by outer approximationMath. Program.199466327349129707010.1007/BF015811530833.90088 – reference: Berthold, T.: Heuristic algorithms in global MINLP solvers. Ph.D. thesis, Technische Universität Berlin (2014) – volume: 36 start-page: 307 year: 1986 ident: 623_CR17 publication-title: Math. Program. doi: 10.1007/BF02592064 – volume: 86 start-page: 991 issue: 7 year: 2014 ident: 623_CR41 publication-title: Chem. Ing. Tech. doi: 10.1002/cite.201400037 – ident: 623_CR4 – volume: 66 start-page: 327 year: 1994 ident: 623_CR20 publication-title: Math. Program. doi: 10.1007/BF01581153 – ident: 623_CR26 – volume: 6 start-page: 33 issue: 1 year: 2014 ident: 623_CR6 publication-title: Math. Program. Comput. doi: 10.1007/s12532-013-0060-9 – ident: 623_CR28 – volume: 102 start-page: 71 issue: 1 year: 2005 ident: 623_CR15 publication-title: Math. Program. doi: 10.1007/s10107-004-0518-7 – ident: 623_CR22 – volume: 106 start-page: 25 year: 2006 ident: 623_CR42 publication-title: Math. Program. doi: 10.1007/s10107-004-0559-y – year: 2008 ident: 623_CR8 publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-010-9350-6 – ident: 623_CR12 doi: 10.1109/MELCON.2004.1346858 – volume: 13 start-page: 219 year: 2012 ident: 623_CR11 publication-title: Optim. Eng. doi: 10.1007/s11081-011-9141-7 – volume: 180 start-page: 012014 issue: 1 year: 2009 ident: 623_CR29 publication-title: J. Phys. Conf. Ser. doi: 10.1088/1742-6596/180/1/012014 – volume: 17 start-page: 680 issue: 4 year: 1969 ident: 623_CR38 publication-title: Oper. Res. doi: 10.1287/opre.17.4.680 – volume: 18 start-page: 2.6:2.1 year: 2013 ident: 623_CR10 publication-title: J. Exp. Algorithmics doi: 10.1145/2532568 – volume: 98 start-page: 23 year: 2003 ident: 623_CR19 publication-title: Math. Program. doi: 10.1007/s10107-003-0395-5 – ident: 623_CR16 – ident: 623_CR31 – volume: 6 start-page: 445 issue: 4 year: 1994 ident: 623_CR39 publication-title: ORSA J. Comput. doi: 10.1287/ijoc.6.4.445 – ident: 623_CR1 – volume: 119 start-page: 331 year: 2009 ident: 623_CR7 publication-title: Math. Program. doi: 10.1007/s10107-008-0212-2 – volume: 10 start-page: 237 year: 1972 ident: 623_CR24 publication-title: J. Optim. Theory Appl. doi: 10.1007/BF00934810 – ident: 623_CR21 doi: 10.1007/978-3-642-83724-1_12 – start-page: 561 volume-title: 50 Years of Integer Programming 1958–2008 year: 2010 ident: 623_CR27 doi: 10.1007/978-3-540-68279-0_15 – volume: 11 start-page: 3 issue: 1 year: 2017 ident: 623_CR2 publication-title: Optim. Lett. doi: 10.1007/s11590-016-1046-0 – ident: 623_CR25 – ident: 623_CR5 – volume: 136 start-page: 375 issue: 2 year: 2012 ident: 623_CR13 publication-title: Math. Program. doi: 10.1007/s10107-012-0608-x – ident: 623_CR9 – ident: 623_CR23 – ident: 623_CR40 – volume: 9 start-page: 329 issue: 4 year: 2011 ident: 623_CR14 publication-title: 4OR doi: 10.1007/s10288-011-0181-9 – volume: 60 start-page: 373 issue: 2 year: 2014 ident: 623_CR33 publication-title: J. Glob. Optim. doi: 10.1007/s10898-014-0217-8 – ident: 623_CR34 – volume: 3 start-page: 349 year: 2011 ident: 623_CR30 publication-title: Math. Program. Comput. doi: 10.1007/s12532-011-0031-y – volume: 8 start-page: 1167 issue: 3 year: 2014 ident: 623_CR32 publication-title: Optim. Lett. doi: 10.1007/s11590-013-0623-8 – volume: 47 start-page: 257 year: 2010 ident: 623_CR35 publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-008-9218-1 – volume: 16 start-page: 937 issue: 10–11 year: 1992 ident: 623_CR37 publication-title: Comput. Chem. Eng. doi: 10.1016/0098-1354(92)80028-8 – volume: 47 start-page: 7802 issue: 20 year: 2008 ident: 623_CR43 publication-title: Indus. Eng. Chem. Res. doi: 10.1021/ie800257x – year: 2016 ident: 623_CR18 publication-title: EURO J. Comput. Optim. doi: 10.1007/s13675-016-0079-6 – ident: 623_CR36 – volume: 4 start-page: 63 issue: 1 year: 2007 ident: 623_CR3 publication-title: Discrete Optim. doi: 10.1016/j.disopt.2006.10.001 |
| SSID | ssj0009852 |
| Score | 2.2511327 |
| Snippet | We present two feasibility heuristics for binary mixed integer nonlinear programming. Called integrality gap minimization algorithm (IGMA)—versions 1 and 2,... We present two feasibility heuristics for binary mixed integer nonlinear programming. Called integrality gap minimization algorithm (IGMA)-versions 1 and 2,... |
| SourceID | proquest gale crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 593 |
| SubjectTerms | Algorithms Computer Science Heuristic Mathematics Mathematics and Statistics Mixed integer Nonlinear programming Operations Research/Decision Theory Optimization Real Functions |
| SummonAdditionalLinks | – databaseName: Science Database dbid: M2P link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T-QwEB7xKqAAFg6xsCAXSHCcLPJwYqdCCIG44hAFnOgsx3YAiceyuyB-PjOJwx6HoKFIlWRsaeyZTx7P9wFsiQyztFcFL5WRXMQm5oV1JUfw4VxOYg9JIzYhT0_V5WVxFg7chuFaZRsT60DtHiydke_VRYKcymL7_UdOqlFUXQ0SGpMwjcZjutL1Jzkbk-6qWnEnKpKMZxiP26pm0zqnqLksxgcRABfv8tL_0flDmbTOPscL3533IswH3MkOmoXSgQl_vwRz_7ARLkEn7PMh2wlk1D-X4e_vhk-C0Dq7Mn1GXCR3oXmTXfunwPTMEPyysm7uxU9evGM1EYUfsPuGjMMMWLgLhhaufsDF8dH54QkPWgzcIiIZcZfJ2ClEcyatIleWVM4zpSqFkJUgyaskM6SdLhOXp4gJ0sJL431lbWKLyCfpCkzheH4VWJRKJ4VT3sbE92cKRGyVkpVxJo_LKu9C1HpC20BUTnoZt3pMsUzO0-g8Tc7Togu7b7_0G5aOrz7eJvdq2sFo15rQiICzIy4sfYDpWmAgz7Iu9Fqf6rC1h3rs0C78alfF-PWnw659bWwdZpN6NdJN4B5MjQZPfgNm7PPoZjjYrNf1K7xk_D0 priority: 102 providerName: ProQuest |
| Title | Integrality gap minimization heuristics for binary mixed integer nonlinear programming |
| URI | https://link.springer.com/article/10.1007/s10898-018-0623-4 https://www.proquest.com/docview/2006662890 |
| Volume | 71 |
| WOSCitedRecordID | wos000435809900010&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: PRVAVX databaseName: SpringerLink customDbUrl: eissn: 1573-2916 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009852 issn: 0925-5001 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3daxQxEB_64YM-WHsqnrZHHoT6QWA_spvsYy0tFun1aLVWX0I2ydZCLeX2Kv75zmSzvX6ooA87sOxsEpKZzMDM_AbgpSjQSntV8VoZyUVqUl5ZV3N0PpwrqdlD1jWbkOOxOj6uJrGOu-2z3fuQZLiprxW7KSoHS_FBm83FIiyjtZOUx3dweDRH2lWhzU5SZQUv8BLuQ5m_G-KGMbp9Jd-JjQaTs7PyX4t9BA-jh8k2O5FYhQV_PoCVvnsDi8o8gAfXoAjxbe8Kv7UdwGrkatmriEv9-jEc7XbQEuS4sxNzwQiW5Hus42Tf_GUEfWboB7M61Pkiy0_vWMCkwLnPO1wOM2UxLQxHOHkCn3a2P26957EtA7fonMy4K2TqFDp2Jm8SV9cU2TO1qoWQjaDuV1lhqI26zFyZo3uQV14a7xtrM1slPsufwhLO558BS3LppHDK25Sg_0yFzlujZGOcKdO6KYeQ9OejbcQsp9YZZ3qOtkwbrXGjNW20FkN4c_XLRQfY8TfmDTp0TcqM41oTaxJwdQSLpTfRcgu804tiCGu9XOio5a0OgauSQrVDeNvLwfzzH6d9_k_cL-B-FgSJcoTXYGk2vfTrcM_-mJ220xEsys9fRrD8bns8OcC3D5Ij3Uu2iGb7gU6IykOkk-LrKKjLL4rhBNw |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1NT9wwEB0hitRyaPloxbZAfQBBi6wmWSd2DhVCFMQKWHGgFTfj2A4gAd3uLv34U_2NnUkcForgxoFDTknsJH6eGWc87wEsiRS9tFc5L5SRXMQm5rl1Bcfgw7mMxB6SWmxCdrvq6Cg_GIO_TS0MbatsbGJlqN13S__IP1VJgozSYuu9H5xUoyi72kho1LDY9X9-4ZJt8LnzBcd3OUm2tw43d3hQFeAWfeuQu1TGTmFcYtpl5IqCElOmUIUQshQk3pSkhlTAZeKyNnq3du6l8b60NrF55InoAE3-M4ELL9pCuB9tjkh-VaXwE-VJylO0_00WtS7VU1TMFuOBEQcXt_zg_97gTlq28nbbr57ad5qClyGuZhv1RJiGMX85A5M32BZnYDrYsQFbDWTbH2bhW6fmy6DVCDsxPUZcKxehOJWd-qvAZM0wuGdFVbyMl_z2jlVEG77PLmuyEdNnYa8btnDyGr4-ytu-gXHsz88Bi9rSSeGUtzHxGZocI9JSydI4k8VFmbUgakZe20DETnog53pEIU1g0QgWTWDRogUfr2_p1SwkD128QnDSZKGwXWtCoQU-HXF96Q0MRwQ6qjRtwXyDIR1M10CPANSCtQaFo9P3dvv24cbew_Odw_09vdfp7r6DF0k1E2jX8zyMD_tXfgEm7M_h2aC_WM0pBsePDc5_9MVXgg |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB5VpUJwoA-outAWH0C8ZDXJOrFzqKqqZcWqaFWJh3ozju2USn0su1ugf62_rjOOw1IQvfXAIackzuvzzDgz830Az0SOXtqrklfKSC5Sk_LSuopj8OFcQWIPWSM2IQcDdXBQ7s_AZdsLQ2WVrU0MhtqdWfpHvhGSBAWlxTbqWBaxv9vbGn7jpCBFmdZWTqOByJ6_-IHLt_Fmfxe_9fMs6739uPOOR4UBbtHPTrjLZeoUxiimWyeuqihJZSpVCSFrQUJOWW5IEVxmruiip-uWXhrva2szWyaeSA_Q_N-RAp8qlA1-mBL-qqD2k5RZznP0BW1GtWnbU9TYluKG0QcX13zin57hrxRt8Hy9-f_5nS3Agxhvs-1mgizCjD9dgvu_sTAuwWK0b2P2MpJwv3oIn_sNjwatUtihGTLiYDmJTavsqz-PDNcMg35WhaZmPOSndywQcPgRO21ISMyIxRo4HOHwEXy6laddhlm8nl8BlnSlk8Ipb1PiOTQlRqq1krVxpkiruuhA0qJA20jQTjohx3pKLU3A0QgcTcDRogOvf50ybNhJbjr4BUFLk-XCca2JDRh4d8QBprcxTBHowPK8A6stnnQ0aWM9BVMH3rSInO7-52Uf3zzYU7iLmNTv-4O9J3AvC5OCiqFXYXYyOvdrMGe_T47Go_UwvRh8uW1sXgFv32B2 |
| 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=Integrality+gap+minimization+heuristics+for+binary+mixed+integer+nonlinear+programming&rft.jtitle=Journal+of+global+optimization&rft.au=Melo%2C+Wendel&rft.au=Fampa%2C+Marcia&rft.au=Raupp%2C+Fernanda&rft.date=2018-07-01&rft.issn=0925-5001&rft.eissn=1573-2916&rft.volume=71&rft.issue=3&rft.spage=593&rft.epage=612&rft_id=info:doi/10.1007%2Fs10898-018-0623-4&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s10898_018_0623_4 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-5001&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-5001&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-5001&client=summon |