The Inverse Bin-Packing Problem Subject to Qualitative Criteria
A new formulation of the reverse bin-packing problem is suggested. One distinct feature of the new formulation is that it takes into account of a decision-maker’s preferences for a set of objects that are evaluated by multiple quality criteria. The aspects of this problem are discussed that relate t...
Saved in:
| Published in | Scientific and technical information processing Vol. 44; no. 6; pp. 440 - 449 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Moscow
Pleiades Publishing
01.12.2017
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | A new formulation of the reverse bin-packing problem is suggested. One distinct feature of the new formulation is that it takes into account of a decision-maker’s preferences for a set of objects that are evaluated by multiple quality criteria. The aspects of this problem are discussed that relate to the theory of multiple criteria decision making. The known methods for solving the classic and the reverse bin-packing problems (the multiple knapsack problem) are reviewed. |
|---|---|
| AbstractList | A new formulation of the reverse bin-packing problem is suggested. One distinct feature of the new formulation is that it takes into account of a decision-maker’s preferences for a set of objects that are evaluated by multiple quality criteria. The aspects of this problem are discussed that relate to the theory of multiple criteria decision making. The known methods for solving the classic and the reverse bin-packing problems (the multiple knapsack problem) are reviewed. |
| Author | Furems, E. M. |
| Author_xml | – sequence: 1 givenname: E. M. surname: Furems fullname: Furems, E. M. email: fem@mail.ru organization: Institute for Systems Analysis, Computer Science and Control Federal Research Center, Russian Academy of Sciences |
| BookMark | eNp9kF9LwzAUxYNMcE4_gG8Fn6u5SZukT6LDP4OBk83nkqbpzOySmaQDv72dEwRFn-7DOb97zz3HaGCd1QidAb6ggOnlHEPGmRAEOGYYs_wADaGgWSoAxAANd3K604_QcQgrjHNGsmKIrhYvOpnYrfZBJzfGpjOpXo1dJjPvqlavk3lXrbSKSXTJUydbE2U0W52MvYnaG3mCDhvZBn36NUfo-e52MX5Ip4_3k_H1NFWUZTEVNS8KVUglKsZwU-caRAaN0DSjGda8IjWomue8N9C6_4E3lABhkjaQA-d0hM73ezfevXU6xHLlOm_7kyXBIApGeA69i-9dyrsQvG5K9RnY2eilaUvA5a6t8ldbPQk_yI03a-nf_2XIngm91y61_870N_QB9Xd6jw |
| CitedBy_id | crossref_primary_10_3103_S0147688218060023 crossref_primary_10_3103_S0147688219060029 |
| Cites_doi | 10.1007/BF00226291 10.1109/ROBOT.1992.220088 10.1023/B:JOCO.0000038915.62826.79 10.1287/mnsc.1070.0838 10.1016/S0377-2217(97)00388-3 10.1137/1.9781611973402.2 10.1137/0203025 10.1137/0207001 10.1287/mnsc.26.1.1 10.1287/opre.1050.0210 10.1016/0020-0190(80)90041-1 10.1016/j.ejor.2005.12.047 10.1016/0377-2217(80)90112-5 10.1007/978-3-7091-6492-1_55 10.1287/mnsc.17.5.259 10.3103/S0147688215060064 10.1016/0166-218X(81)90005-6 10.1016/0377-2217(77)90024-8 10.1016/S0377-2217(02)00134-0 10.1287/opre.26.1.3 10.1287/opre.1120.1109 10.1145/326619.326694 10.1287/moor.18.2.438 10.1016/S0166-218X(01)00253-0 10.1002/mcda.380 10.1016/S0166-218X(01)00347-X 10.1007/3-540-58495-1_14 10.1016/S0377-2217(98)00120-9 10.1016/S0377-2217(02)00124-8 10.1016/S0305-0548(96)00082-2 10.1137/0603007 10.1007/BF02125404 10.1007/978-3-642-58165-6 10.1145/322186.322187 10.1016/S0022-0000(74)80026-7 10.1016/j.cor.2014.10.010 10.1016/S0377-2217(02)00135-2 10.1016/S0167-5060(08)70356-X 10.1023/A:1018952112615 10.1016/0097-3165(76)90001-7 10.1023/B:ANOR.0000039519.03572.08 10.1007/s10479-013-1341-4 10.1037/13978-000 10.1137/0212014 10.1137/0208016 10.17562/PB-51-7 10.1016/j.ejor.2009.01.064 10.1016/0166-218X(90)90094-S 10.1007/978-3-662-43948-7_36 10.1007/978-1-4684-2001-2_9 10.1613/jair.2106 |
| ContentType | Journal Article |
| Copyright | Allerton Press, Inc. 2017 Scientific and Technical Information Processing is a copyright of Springer, (2017). All Rights Reserved. |
| Copyright_xml | – notice: Allerton Press, Inc. 2017 – notice: Scientific and Technical Information Processing is a copyright of Springer, (2017). All Rights Reserved. |
| DBID | AAYXX CITATION 3V. 7SC 7XB 88I 8AL 8FD 8FE 8FG 8FK ABUWG AFKRA ALSLI ARAPS AZQEC BENPR BGLVJ CCPQU CNYFK DWQXO GNUQQ HCIFZ JQ2 K7- L7M L~C L~D M0N M1O M2P P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PRQQA Q9U |
| DOI | 10.3103/S0147688217060065 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ProQuest Central (purchase pre-March 2016) Science Database (Alumni Edition) Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest Central UK/Ireland Social Science Premium Collection Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One Community College Library & Information Science Collection ProQuest Central ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Library Science Database Science Database (ProQuest) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) 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 One Social Sciences ProQuest Central Basic |
| DatabaseTitle | CrossRef Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Library Science ProQuest Central Korea Library & Information Science Collection ProQuest Central (New) Advanced Technologies Database with Aerospace Advanced Technologies & Aerospace Collection Social Science Premium Collection ProQuest Computing ProQuest Science Journals (Alumni Edition) ProQuest One Social Sciences ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition ProQuest One Academic ProQuest Central (Alumni) ProQuest One Academic (New) |
| DatabaseTitleList | Computer Science Database |
| Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Library & Information Science Computer Science |
| EISSN | 1934-8118 |
| EndPage | 449 |
| ExternalDocumentID | 10_3103_S0147688217060065 |
| GroupedDBID | -59 -5G -BR -EM -Y2 -~C .86 .VR 06D 0R~ 0VY 123 1N0 2J2 2JN 2JY 2KG 2KM 2LR 2VQ 2~H 30V 3V. 4.4 408 40D 40E 5VS 6NX 88I 8FE 8FG 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABDZT ABECU ABFTD ABFTV ABHQN ABJNI ABJOX ABKCH ABMNI ABMQK ABNWP ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACCUX ACDTI ACGFS ACGOD ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADRFC ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEMSY AEOHA AEPYU AETLH AEVLU AEXYK AFBBN AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO ALMA_UNASSIGNED_HOLDINGS ALSLI ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARMRJ AXYYD AZQEC B-. BA0 BDATZ BENPR BGLVJ BGNMA BPHCQ CAG CCPQU CNYFK COF CS3 DDRTE DNIVK DPUIP DWQXO EBLON EBS EIOEI EJD ESBYG FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 H13 HCIFZ HF~ HG6 HLICF HMJXF HRMNR HZ~ IJ- IKXTQ IWAJR I~X I~Z J-C JBSCW JZLTJ K6V K7- KOV LLZTM M0N M1O M2P M4Y MA- NPVJJ NQJWS NU0 O9- O93 O9J P62 P9O PF0 PQQKQ PROAC PT4 Q2X QOS R89 R9I RIG ROL RPX RSV S16 S1Z S27 S3B SAP SCO SDH SHX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TSG TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W48 WK8 XU3 YLTOR ZMTXR ~A9 AAPKM AAYXX ABDBE ABFSG ACSTC AEZWR AFDZB AFHIU AFOHR AHPBZ AHWEU AIXLP ATHPR CITATION PHGZM PHGZT 7SC 7XB 8AL 8FD 8FK ABRTQ JQ2 L7M L~C L~D PKEHL PQEST PQGLB PQUKI PRINS PRQQA Q9U |
| ID | FETCH-LOGICAL-c364t-8d799c9ac8b660fd5e1841f8e34340e7b2d1cd757c8b3d1707f32126a3f151773 |
| IEDL.DBID | BENPR |
| ISSN | 0147-6882 |
| IngestDate | Wed Aug 13 02:27:06 EDT 2025 Tue Jul 01 02:51:19 EDT 2025 Thu Apr 24 22:55:10 EDT 2025 Fri Feb 21 02:34:13 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Keywords | inverse bin-packing problem branch and bound method genetic algorithms ordinal classification approximate algorithm preference relation |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c364t-8d799c9ac8b660fd5e1841f8e34340e7b2d1cd757c8b3d1707f32126a3f151773 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 2018962751 |
| PQPubID | 54364 |
| PageCount | 10 |
| ParticipantIDs | proquest_journals_2018962751 crossref_citationtrail_10_3103_S0147688217060065 crossref_primary_10_3103_S0147688217060065 springer_journals_10_3103_S0147688217060065 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2017-12-01 |
| PublicationDateYYYYMMDD | 2017-12-01 |
| PublicationDate_xml | – month: 12 year: 2017 text: 2017-12-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Moscow |
| PublicationPlace_xml | – name: Moscow – name: Dordrecht |
| PublicationTitle | Scientific and technical information processing |
| PublicationTitleAbbrev | Sci. Tech. Inf. Proc |
| PublicationYear | 2017 |
| Publisher | Pleiades Publishing Springer Nature B.V |
| Publisher_xml | – name: Pleiades Publishing – name: Springer Nature B.V |
| References | Martello, Toth (CR1) 1980; 4 Geri, Dzhonson (CR11) 1982 Chung, Garey, Johnson (CR14) 1982; 3 Berkey, Wang (CR15) 1987 von Winterfeldt (CR36) 1980; 45 Lodi, Martello, Vigo (CR17) 1999; 112 Larichev, Moshkovich (CR41) 1996 Smith (CR66) 1985 Wallenius, Dyer, Fishburn, Steuer, Zionts, Deb (CR37) 2008; 54 André, Stubs (CR78) 2015; 51 Frederickson (CR53) 1980; 11 Cotta, Troya (CR77) 1998 Falkenauer (CR69) 1996; 2 Garey, Graham, Johnson, Yao (CR6) 1976; 21 Scholl, Klein, Jürgens (CR59) 1997; 24 Johnson, Demers, Ullman, Garey, Graham (CR2) 1974; 3 Ashikhmin, Furems, Petrovsky, Sternin (CR42) 2008; 2 Pisinger (CR64) 1999; 114 Lodi, Martello, Vigo (CR22) 2004; 8 Garey, Graham, Ullman (CR49) 1973 Schreiber, Korf (CR62) 2013 Coffman, Garey, Johnson (CR51) 1978; 7 Mukhacheva, Valeeva, Filippova, Polyakovskii (CR26) 2006; 4 Graham, Lawler, Lenstra, Kan (CR5) 1979; 5 Marshal, Fisher (CR45) 1980; 26 Gimadi, Zalyubovskii, Sharygin (CR16) 1997; 12 Simon (CR34) 1960 Reeves (CR70) 1996; 63 Quiroz-Castellanos (CR74) 2015; 55 Krause, Parpinelli, Lopes (CR79) 2012 Boyar (CR32) 2014 de Carvalho (CR54) 2002; 141 Lins, Lins, Morabito (CR28) 2002; 141 Goodman, Hedetniemi (CR44) 1977 Martello, Toth (CR56) 1990 Fukunaga, Korf (CR61) 2007; 28 Furems (CR38) 2007; 3 Dósa, Sigall (CR50) 2014 Furems (CR40) 2015; 42 Furems (CR9) 1986 Chi-Chin (CR52) 1980; 27 Dell'Amico, Díaz, Iori (CR8) 2012; 60 Coffman, Garey, Johnson (CR46) 1984 Garey, Graham, Johnson (CR7) 1978; 26 Martello, Toth (CR63) 1981; 3 Valeeva (CR25) 2005; 10 Johnson (CR47) 1974; 8 Rhee, Talagrand (CR30) 1993; 18 Dyckhoff, Finke (CR12) 1992 Lodi, Martello, Vigo (CR21) 2004; 131 Boyar, Fayholdt, Larsen, Nielsen (CR31) 2001; 8 CR10 Lodi, Martello, Vigo (CR20) 2002; 141 Korf (CR58) 2002 Lodi, Martello, Vigo (CR19) 2002; 123 Falkenauer, Delchambre (CR68) 1992; 2 Coffman (CR3) 1978; 9 den Boef, Korst, Martello, Pisinger, Vigo (CR23) 2005; 53 Ashikhmin, Furems (CR43) 2005; 13 Ullman (CR48) 1971 Eilon, Christofides (CR55) 1990; 17 Delorme, Iori, Martello (CR33) 2015 Ross, Marín-Blázquez, Schulenburg, Hart (CR71) 2003 Djang, Finch (CR72) 1998 Coffman, Garey, Johnson (CR29) 1993; 12 Wäscher, Hausner, Schumann (CR13) 2007; 183 de Carvalho (CR60) 1999; 86 Bansal, Khan (CR24) 2014 Dell'Amico, Martello, Vigo (CR18) 2002; 118 Khuri, Bäck, Heitkötter (CR75) 1994 Furems (CR39) 2011; 19 Martello, Toth (CR65) 1977; 1 Sim, Hart, Paechter (CR73) 2012 Coffman, Jr, Leung (CR4) 1979; 8 Prosser (CR67) 1988 Saaty, Shihb (CR35) 2009; 199 López-Camacho (CR27) 2013; 206 Martello, Toth (CR57) 1990; 28 Michalewicz, Arabas (CR76) 1994 E. López-Camacho (6479_CR27) 2013; 206 M. Dell'Amico (6479_CR18) 2002; 118 E.M. Furems (6479_CR40) 2015; 42 J. Krause (6479_CR79) 2012 W.T. Rhee (6479_CR30) 1993; 18 J.M. Carvalho de (6479_CR54) 2002; 141 E.A. Mukhacheva (6479_CR26) 2006; 4 G.N. Frederickson (6479_CR53) 1980; 11 D.S. Johnson (6479_CR47) 1974; 8 C. Cotta (6479_CR77) 1998 E.L. Schreiber (6479_CR62) 2013 M.R. Garey (6479_CR6) 1976; 21 R.E. Korf (6479_CR58) 2002 E.G. Coffman (6479_CR3) 1978; 9 A.F. Valeeva (6479_CR25) 2005; 10 J. Wallenius (6479_CR37) 2008; 54 P. Prosser (6479_CR67) 1988 T. Saaty (6479_CR35) 2009; 199 O.I. Larichev (6479_CR41) 1996 D. Pisinger (6479_CR64) 1999; 114 D.S. Johnson (6479_CR2) 1974; 3 Z. Michalewicz (6479_CR76) 1994 Jr. Coffman (6479_CR51) 1978; 7 L. Marshal (6479_CR45) 1980; 26 P.A. Djang (6479_CR72) 1998 A. Scholl (6479_CR59) 1997; 24 J. Boyar (6479_CR31) 2001; 8 S. Eilon (6479_CR55) 1990; 17 A. Lodi (6479_CR19) 2002; 123 E.M. Furems (6479_CR39) 2011; 19 G. Wäscher (6479_CR13) 2007; 183 S. Martello (6479_CR56) 1990 S. Khuri (6479_CR75) 1994 S. Martello (6479_CR1) 1980; 4 L. André (6479_CR78) 2015; 51 D. Smith (6479_CR66) 1985 E. Boef den (6479_CR23) 2005; 53 N. Bansal (6479_CR24) 2014 J. Boyar (6479_CR32) 2014 E.Kh. Gimadi (6479_CR16) 1997; 12 H. Simon (6479_CR34) 1960 J.D. Ullman (6479_CR48) 1971 M. Dell'Amico (6479_CR8) 2012; 60 P. Ross (6479_CR71) 2003 6479_CR10 E. Falkenauer (6479_CR68) 1992; 2 G. Dósa (6479_CR50) 2014 A. Lodi (6479_CR20) 2002; 141 C. Reeves (6479_CR70) 1996; 63 K. Sim (6479_CR73) 2012 E.M. Furems (6479_CR9) 1986 A.S. Fukunaga (6479_CR61) 2007; 28 A. Lodi (6479_CR17) 1999; 112 S. Martello (6479_CR57) 1990; 28 R.L. Graham (6479_CR5) 1979; 5 M. Delorme (6479_CR33) 2015 A. Lodi (6479_CR22) 2004; 8 M. Geri (6479_CR11) 1982 S. Martello (6479_CR63) 1981; 3 M.R. Garey (6479_CR7) 1978; 26 M. Quiroz-Castellanos (6479_CR74) 2015; 55 F.R. Chung (6479_CR14) 1982; 3 E.G. Coffman Jr. (6479_CR29) 1993; 12 H. Dyckhoff (6479_CR12) 1992 A. Lodi (6479_CR21) 2004; 131 L. Lins (6479_CR28) 2002; 141 M.R. Garey (6479_CR49) 1973 E. Falkenauer (6479_CR69) 1996; 2 E.G. Coffman (6479_CR4) 1979; 8 J.O. Berkey (6479_CR15) 1987 I. Ashikhmin (6479_CR43) 2005; 13 S. Martello (6479_CR65) 1977; 1 E.M. Furems (6479_CR38) 2007; 3 Jr. Coffman (6479_CR46) 1984 Y. Chi-Chin (6479_CR52) 1980; 27 S.E. Goodman (6479_CR44) 1977 I. Ashikhmin (6479_CR42) 2008; 2 D. Winterfeldt von (6479_CR36) 1980; 45 J.M. Carvalho de (6479_CR60) 1999; 86 |
| References_xml | – volume: 2 start-page: 5 issue: 1 year: 1996 end-page: 30 ident: CR69 article-title: A hybrid grouping genetic algorithm for bin packing publication-title: J. Heuristics doi: 10.1007/BF00226291 – volume: 2 start-page: 1186 year: 1992 end-page: 1192 ident: CR68 article-title: A genetic algorithm for bin-packing and line balancing publication-title: Proceedings of the 1992 IEEE International Conference on Robotics and Automation, Nice doi: 10.1109/ROBOT.1992.220088 – volume: 8 start-page: 363 issue: 3 year: 2004 end-page: 379 ident: CR22 article-title: Models and bounds for two-dimensional level packing problems publication-title: J. Comb. Optim. doi: 10.1023/B:JOCO.0000038915.62826.79 – volume: 54 start-page: 1336 issue: 7 year: 2008 end-page: 1349 ident: CR37 article-title: Multiple criteria decision making, multiattribute utility analysis: Recent accomplishments and what lies ahead publication-title: Manage. Sci. doi: 10.1287/mnsc.1070.0838 – volume: 112 start-page: 158 issue: 1 year: 1999 end-page: 166 ident: CR17 article-title: Approximation algorithms for the oriented two-dimensional bin packing problem publication-title: EJOR doi: 10.1016/S0377-2217(97)00388-3 – start-page: 13 year: 2014 end-page: 25 ident: CR24 article-title: Improved approximation algorithm for two-dimensional bin packing publication-title: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms doi: 10.1137/1.9781611973402.2 – volume: 3 start-page: 299 issue: 4 year: 1974 end-page: 325 ident: CR2 article-title: Worst-case performance bounds for simple one-dimensional packing algorithms publication-title: SIAM J. Comput. doi: 10.1137/0203025 – volume: 45 start-page: 71 year: 1980 end-page: 93 ident: CR36 article-title: Structuring decision problems for decision analysis publication-title: ActaPsychologica – start-page: 429 year: 2014 end-page: 441 ident: CR50 article-title: Optimal analysis of Best Fit bin packing publication-title: Automata, Languages, and Programming – start-page: 423 year: 1987 end-page: 429 ident: CR15 article-title: Two-dimensional finite bin-packing algorithms publication-title: J. Oper. Res. Soc. – volume: 8 start-page: 463 year: 2001 end-page: 472 ident: CR31 article-title: The competitive ratio for on-line dual bin packing with restricted input sequences publication-title: Nordic J. Comput. – volume: 7 start-page: 1 issue: 1 year: 1978 end-page: 17 ident: CR51 article-title: An application of bin packing to multiprocessor scheduling publication-title: SIAM J. Comput. doi: 10.1137/0207001 – start-page: 1295 year: 2003 end-page: 1306 ident: CR71 publication-title: Learning a Procedure That Can Solve Hard Bin-Packing Problems: A New GA-Based Approach to Hyper-heuristics – volume: 26 start-page: 1 issue: 1 year: 1980 end-page: 8 ident: CR45 article-title: Worst-case analysis of heuristics algorithms publication-title: Manage. Sci. doi: 10.1287/mnsc.26.1.1 – volume: 10 start-page: 36 year: 2005 end-page: 43 ident: CR25 article-title: Application of meta-heuristics of the ant colony to the problems of two-dimensional packaging publication-title: Inf. Tekhnol. – volume: 53 start-page: 735 issue: 4 year: 2005 end-page: 736 ident: CR23 article-title: Erratum to 'The three-dimensional bin packing problem’: Robot-packable and orthogonal variants of packing problems publication-title: Oper. Res. doi: 10.1287/opre.1050.0210 – volume: 9 start-page: 263 year: 1978 end-page: 271 ident: CR3 article-title: Jr. publication-title: Leung, J.Y.-T., and Ting, D., Bin packing: Maximizing the number of pieces packed, Acta Inf. – volume: 2 start-page: 514 year: 2008 end-page: 527 ident: CR42 article-title: Intelligent DSS under verbal decision analysis, in Encyclopedia of Decision Making and Decision Support Technologies publication-title: Frederic Adam, Ed., Hershey – start-page: 202 year: 1985 end-page: 206 ident: CR66 article-title: Bin-packing with adaptive search publication-title: Proceedings of an International Conference on Genetic Algorithms and Their Applications – volume: 11 start-page: 156 issue: 4–5 year: 1980 end-page: 161 ident: CR53 article-title: Probabilistic analysis for simple one-and two-dimensional bin packing algorithms publication-title: Inf. Process. Lett. doi: 10.1016/0020-0190(80)90041-1 – volume: 183 start-page: 1109 issue: 3 year: 2007 end-page: 1130 ident: CR13 article-title: An improved typology of cutting and packing problems publication-title: EJOR doi: 10.1016/j.ejor.2005.12.047 – volume: 3 start-page: 7 year: 2007 end-page: 17 ident: CR38 article-title: Structuring of classification problems based on knowledge publication-title: Inf. Tekhnol. Vychisl. Sist. – start-page: 123 year: 1998 end-page: 144 ident: CR72 article-title: Solving one dimensional bin packing problems publication-title: J. Heuristics – volume: 4 start-page: 276 issue: 4 year: 1980 end-page: 283 ident: CR1 article-title: Solution of the zero-one multiple knapsack problem publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(80)90112-5 – start-page: 250 year: 1998 end-page: 254 ident: CR77 article-title: A hybrid genetic algorithm for the 0-1 multiple knapsack problem publication-title: Artificial Neural Nets and Genetic Algorithms doi: 10.1007/978-3-7091-6492-1_55 – volume: 17 start-page: 259 year: 1990 end-page: 267 ident: CR55 article-title: The loading problem publication-title: Manage. Sci. doi: 10.1287/mnsc.17.5.259 – volume: 42 start-page: 481 issue: 6 year: 2015 end-page: 489 ident: CR40 article-title: Stepclass-based approach to multicriteria sorting publication-title: Sci. Tech. Inf. Process. doi: 10.3103/S0147688215060064 – year: 1971 ident: CR48 publication-title: The performance of a memory allocation algorithm, in Technical Report 100 – volume: 3 start-page: 275 year: 1981 end-page: 288 ident: CR63 article-title: A bound and bound algorithm for the zero-one multiple knapsack problem publication-title: Discrete Appl. Math. doi: 10.1016/0166-218X(81)90005-6 – volume: 1 start-page: 169 year: 1977 end-page: 175 ident: CR65 article-title: An upper bound for the zeroone knapsack problem and a branch and bound algorithm publication-title: EJOR doi: 10.1016/0377-2217(77)90024-8 – start-page: 348 year: 2012 end-page: 357 ident: CR73 publication-title: A Hyper-Heuristic Classifier for One Dimensional Bin Packing Problems: Improving Classification Accuracy by Attribute Evolution – start-page: 159 year: 1988 end-page: 164 ident: CR67 article-title: A hybrid genetic algorithm for pallet loading publication-title: ECAI 88 Proceedings 8th European Conference on Artificial Intelligence – volume: 141 start-page: 410 issue: 2 year: 2002 end-page: 420 ident: CR20 article-title: Heuristic algorithms for the three-dimensional bin packing problem publication-title: EJOR doi: 10.1016/S0377-2217(02)00134-0 – volume: 26 start-page: 3 issue: 1 year: 1978 end-page: 21 ident: CR7 article-title: Performance guarantees for scheduling algorithms publication-title: Oper. Res. doi: 10.1287/opre.26.1.3 – volume: 60 start-page: 1491 issue: 6 year: 2012 end-page: 1504 ident: CR8 article-title: The bin packing problem with precedence constraints publication-title: Oper. Res. doi: 10.1287/opre.1120.1109 – volume: 12 start-page: 34 year: 1997 end-page: 44 ident: CR16 article-title: The problem of packing in a strip: An asymptotically exact approach publication-title: Izv. Vyssh. Uch. Zaved., Mat. – start-page: 188 year: 1994 end-page: 193 ident: CR75 article-title: The zero/one multiple knapsack problem and genetic algorithms publication-title: Proceedings of the 1994 ACM Symposium on Applied Computing doi: 10.1145/326619.326694 – start-page: 49 year: 1984 end-page: 106 ident: CR46 article-title: Approximation algorithms for bin-packing—an updated survey publication-title: Algorithm Design for Computer System Design – volume: 18 start-page: 438 year: 1993 end-page: 445 ident: CR30 article-title: On-line bin packing with items of random size publication-title: Math. Oper. Res. doi: 10.1287/moor.18.2.438 – volume: 118 start-page: 13 issue: 1–2 year: 2002 end-page: 24 ident: CR18 article-title: A lower bound for the non-oriented two-dimensional bin packing problem publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(01)00253-0 – volume: 13 start-page: 147 issue: 2–3 year: 2005 end-page: 157 ident: CR43 article-title: UniComBOS: Intelligent decision support system for multi-criteria comparison and choice publication-title: J. Multi-Criteria Decision Anal. doi: 10.1002/mcda.380 – year: 2013 ident: CR62 publication-title: Improved bin completion for optimal bin packing and number partitioning – volume: 123 start-page: 379 issue: 1–3 year: 2002 end-page: 396 ident: CR19 article-title: Recent advances on two-dimensional bin packing problems publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(01)00347-X – start-page: 134 year: 1994 end-page: 143 ident: CR76 article-title: Genetic algorithms for the 0/1 knapsack problem publication-title: Methodologies for Intelligent Systems doi: 10.1007/3-540-58495-1_14 – volume: 28 start-page: 393 year: 2007 end-page: 429 ident: CR61 article-title: Bin completion algorithms for multicontainer packing, knapsack, and covering problems publication-title: J. Artif. Intell. Res. – start-page: 1 year: 2014 end-page: 21 ident: CR32 article-title: Online bin packing with advice publication-title: Algorithmica – ident: CR10 – start-page: 731 year: 2002 end-page: 736 ident: CR58 article-title: A new algorithm for optimal bin packing publication-title: AAAI/IAAI – volume: 114 start-page: 528 year: 1999 end-page: 541 ident: CR64 article-title: An exact algorithm for large multiple knapsack problems publication-title: EJOR doi: 10.1016/S0377-2217(98)00120-9 – volume: 141 start-page: 253 issue: 2 year: 2002 end-page: 273 ident: CR54 article-title: LP models for bin packing and cutting stock problems publication-title: EJOR doi: 10.1016/S0377-2217(02)00124-8 – volume: 24 start-page: 627 year: 1997 end-page: 645 ident: CR59 article-title: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem publication-title: Comput. Oper. Res. doi: 10.1016/S0305-0548(96)00082-2 – volume: 4 start-page: 45 year: 2006 end-page: 52 ident: CR26 article-title: The problem of two-dimensional container packaging: Lower bounds and a numerical experiment with algorithms for local optimum search publication-title: Inf. Tekhnol. – year: 1996 ident: CR41 publication-title: (Qualitative Methods of Decision-Making) – year: 2012 ident: CR79 article-title: Proposta de um algoritmo inspirado em evolucao diferencial aplicado ao problema multidimensional da mochila publication-title: Anais do IX Encontro Nacional de Inteligencia Artificial-ENIA – volume: 3 start-page: 66 issue: 1 year: 1982 end-page: 76 ident: CR14 article-title: On packing two-dimensional bins publication-title: SIAM J. Algebraic Discrete Methods doi: 10.1137/0603007 – start-page: 77 year: 2015 ident: CR33 article-title: Bin packing and cutting stock problems: Mathematical models and exact algorithms publication-title: AIRO 2014 Conference – volume: 63 start-page: 371 issue: 3 year: 1996 end-page: 396 ident: CR70 article-title: Hybrid genetic algorithms for bin-packing and related problems publication-title: Ann. Oper. Res. doi: 10.1007/BF02125404 – year: 1986 ident: CR9 publication-title: Packaging models in multi-criteria decision-making problems with limited resources – year: 1992 ident: CR12 publication-title: Cutting and Packing in Production and Distribution: A Typology and Bibliography doi: 10.1007/978-3-642-58165-6 – volume: 27 start-page: 207 issue: 2 year: 1980 end-page: 227 ident: CR52 article-title: New algorithms for bin packing publication-title: J. Assoc. Comput. Mach. doi: 10.1145/322186.322187 – year: 1977 ident: CR44 publication-title: Introduction to the Design and Analysis of Algorithms – year: 1982 ident: CR11 publication-title: (Computing Machines and Hard-To-Solve Problems) – volume: 8 start-page: 272 issue: 3 year: 1974 end-page: 314 ident: CR47 article-title: Fast algorithms for bin packing publication-title: J. Comput. Syst. Sci. doi: 10.1016/S0022-0000(74)80026-7 – volume: 55 start-page: 52 year: 2015 end-page: 64 ident: CR74 article-title: A grouping genetic algorithm with controlled gene transmission for the bin packing problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2014.10.010 – volume: 141 start-page: 421 year: 2002 end-page: 439 ident: CR28 article-title: An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container publication-title: EJOR doi: 10.1016/S0377-2217(02)00135-2 – volume: 5 start-page: 287 year: 1979 end-page: 326 ident: CR5 article-title: Optimization and approximation in deterministic sequencing and scheduling: A survey publication-title: Ann. Discrete Math. doi: 10.1016/S0167-5060(08)70356-X – start-page: 143 year: 1973 end-page: 150 ident: CR49 article-title: Worstcase analysis of memory allocation algorithms publication-title: Proc. 4th Symp. Theory of Computing (STOC) – volume: 86 start-page: 629 year: 1999 end-page: 659 ident: CR60 article-title: Exact solution of bin-packing problems using column generation and branch-and-bound publication-title: Ann. Oper. Res. doi: 10.1023/A:1018952112615 – volume: 21 start-page: 257 issue: 3 year: 1976 end-page: 298 ident: CR6 article-title: Resource constrained scheduling as generalized bin packing publication-title: J. Comb. Theory, Ser. A doi: 10.1016/0097-3165(76)90001-7 – volume: 131 start-page: 203 issue: 1–4 year: 2004 end-page: 213 ident: CR21 article-title: TSpack: A unified tabu search code for multi-dimensional bin packing problems publication-title: Ann. OR doi: 10.1023/B:ANOR.0000039519.03572.08 – start-page: 221 year: 1990 end-page: 245 ident: CR56 article-title: Bin-packing problem publication-title: Knapsack Problems: Algorithms and Computer Implementations – volume: 206 start-page: 241 issue: 1 year: 2013 end-page: 264 ident: CR27 article-title: An effective heuristic for the two-dimensional irregular bin packing problem publication-title: Ann. Oper. Res. doi: 10.1007/s10479-013-1341-4 – year: 1960 ident: CR34 publication-title: The New Science of Management Decision doi: 10.1037/13978-000 – volume: 12 start-page: 227 year: 1993 end-page: 258 ident: CR29 article-title: Dynamic bin packing publication-title: SIAM J. Comput. doi: 10.1137/0212014 – volume: 8 start-page: 202 issue: 2 year: 1979 end-page: 217 ident: CR4 article-title: Combinatorial analysis of an efficient algorithm for processor and storage allocation publication-title: SIAM J. Comput. doi: 10.1137/0208016 – volume: 19 start-page: 402 year: 2011 end-page: 420 ident: CR39 article-title: Domain Structuring for Knowledge-Based Multiattribute Classification (A Verbal Decision Analysis Approach) publication-title: Berlin/Heidelberg: Springer – volume: 51 start-page: 47 year: 2015 end-page: 54 ident: CR78 article-title: The multiple knapsack problem approached by a binary differential evolution algorithm with adaptive parameters publication-title: Polibits doi: 10.17562/PB-51-7 – volume: 199 start-page: 867 issue: 3 year: 2009 end-page: 872 ident: CR35 article-title: Structures in decision making: On the subjective geometry of hierarchies and networks publication-title: EJOR doi: 10.1016/j.ejor.2009.01.064 – volume: 28 start-page: 59 year: 1990 end-page: 70 ident: CR57 article-title: Lower bounds and reduction procedures for the bin packing problem publication-title: Discrete Appl. Math. doi: 10.1016/0166-218X(90)90094-S – volume: 141 start-page: 253 issue: 2 year: 2002 ident: 6479_CR54 publication-title: EJOR doi: 10.1016/S0377-2217(02)00124-8 – volume: 53 start-page: 735 issue: 4 year: 2005 ident: 6479_CR23 publication-title: Oper. Res. doi: 10.1287/opre.1050.0210 – volume: 18 start-page: 438 year: 1993 ident: 6479_CR30 publication-title: Math. Oper. Res. doi: 10.1287/moor.18.2.438 – volume: 45 start-page: 71 year: 1980 ident: 6479_CR36 publication-title: ActaPsychologica – volume: 7 start-page: 1 issue: 1 year: 1978 ident: 6479_CR51 publication-title: SIAM J. Comput. doi: 10.1137/0207001 – volume: 4 start-page: 45 year: 2006 ident: 6479_CR26 publication-title: Inf. Tekhnol. – volume: 19 start-page: 402 year: 2011 ident: 6479_CR39 publication-title: Berlin/Heidelberg: Springer – volume: 54 start-page: 1336 issue: 7 year: 2008 ident: 6479_CR37 publication-title: Manage. Sci. doi: 10.1287/mnsc.1070.0838 – start-page: 143 volume-title: Proc. 4th Symp. Theory of Computing (STOC) year: 1973 ident: 6479_CR49 – volume: 21 start-page: 257 issue: 3 year: 1976 ident: 6479_CR6 publication-title: J. Comb. Theory, Ser. A doi: 10.1016/0097-3165(76)90001-7 – volume: 112 start-page: 158 issue: 1 year: 1999 ident: 6479_CR17 publication-title: EJOR doi: 10.1016/S0377-2217(97)00388-3 – start-page: 429 volume-title: Automata, Languages, and Programming year: 2014 ident: 6479_CR50 doi: 10.1007/978-3-662-43948-7_36 – volume: 13 start-page: 147 issue: 2–3 year: 2005 ident: 6479_CR43 publication-title: J. Multi-Criteria Decision Anal. doi: 10.1002/mcda.380 – volume: 63 start-page: 371 issue: 3 year: 1996 ident: 6479_CR70 publication-title: Ann. Oper. Res. doi: 10.1007/BF02125404 – volume: 123 start-page: 379 issue: 1–3 year: 2002 ident: 6479_CR19 publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(01)00347-X – volume: 26 start-page: 3 issue: 1 year: 1978 ident: 6479_CR7 publication-title: Oper. Res. doi: 10.1287/opre.26.1.3 – start-page: 123 volume-title: J. Heuristics year: 1998 ident: 6479_CR72 – start-page: 1295 volume-title: Learning a Procedure That Can Solve Hard Bin-Packing Problems: A New GA-Based Approach to Hyper-heuristics year: 2003 ident: 6479_CR71 – volume: 118 start-page: 13 issue: 1–2 year: 2002 ident: 6479_CR18 publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(01)00253-0 – volume: 114 start-page: 528 year: 1999 ident: 6479_CR64 publication-title: EJOR doi: 10.1016/S0377-2217(98)00120-9 – volume: 131 start-page: 203 issue: 1–4 year: 2004 ident: 6479_CR21 publication-title: Ann. OR doi: 10.1023/B:ANOR.0000039519.03572.08 – volume-title: The New Science of Management Decision year: 1960 ident: 6479_CR34 doi: 10.1037/13978-000 – volume-title: The performance of a memory allocation algorithm, in Technical Report 100 year: 1971 ident: 6479_CR48 – volume: 86 start-page: 629 year: 1999 ident: 6479_CR60 publication-title: Ann. Oper. Res. doi: 10.1023/A:1018952112615 – ident: 6479_CR10 doi: 10.1007/978-1-4684-2001-2_9 – volume: 17 start-page: 259 year: 1990 ident: 6479_CR55 publication-title: Manage. Sci. doi: 10.1287/mnsc.17.5.259 – volume-title: Introduction to the Design and Analysis of Algorithms year: 1977 ident: 6479_CR44 – volume: 55 start-page: 52 year: 2015 ident: 6479_CR74 publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2014.10.010 – volume: 9 start-page: 263 year: 1978 ident: 6479_CR3 publication-title: Leung, J.Y.-T., and Ting, D., Bin packing: Maximizing the number of pieces packed, Acta Inf. – volume: 3 start-page: 299 issue: 4 year: 1974 ident: 6479_CR2 publication-title: SIAM J. Comput. doi: 10.1137/0203025 – volume-title: Cutting and Packing in Production and Distribution: A Typology and Bibliography year: 1992 ident: 6479_CR12 doi: 10.1007/978-3-642-58165-6 – volume: 10 start-page: 36 year: 2005 ident: 6479_CR25 publication-title: Inf. Tekhnol. – start-page: 348 volume-title: A Hyper-Heuristic Classifier for One Dimensional Bin Packing Problems: Improving Classification Accuracy by Attribute Evolution year: 2012 ident: 6479_CR73 – volume: 141 start-page: 421 year: 2002 ident: 6479_CR28 publication-title: EJOR doi: 10.1016/S0377-2217(02)00135-2 – volume: 8 start-page: 363 issue: 3 year: 2004 ident: 6479_CR22 publication-title: J. Comb. Optim. doi: 10.1023/B:JOCO.0000038915.62826.79 – volume: 51 start-page: 47 year: 2015 ident: 6479_CR78 publication-title: Polibits doi: 10.17562/PB-51-7 – start-page: 159 volume-title: ECAI 88 Proceedings 8th European Conference on Artificial Intelligence year: 1988 ident: 6479_CR67 – volume: 2 start-page: 1186 year: 1992 ident: 6479_CR68 publication-title: Proceedings of the 1992 IEEE International Conference on Robotics and Automation, Nice doi: 10.1109/ROBOT.1992.220088 – volume: 8 start-page: 272 issue: 3 year: 1974 ident: 6479_CR47 publication-title: J. Comput. Syst. Sci. doi: 10.1016/S0022-0000(74)80026-7 – start-page: 77 volume-title: AIRO 2014 Conference year: 2015 ident: 6479_CR33 – volume: 199 start-page: 867 issue: 3 year: 2009 ident: 6479_CR35 publication-title: EJOR doi: 10.1016/j.ejor.2009.01.064 – volume: 183 start-page: 1109 issue: 3 year: 2007 ident: 6479_CR13 publication-title: EJOR doi: 10.1016/j.ejor.2005.12.047 – volume: 24 start-page: 627 year: 1997 ident: 6479_CR59 publication-title: Comput. Oper. Res. doi: 10.1016/S0305-0548(96)00082-2 – volume-title: Anais do IX Encontro Nacional de Inteligencia Artificial-ENIA year: 2012 ident: 6479_CR79 – start-page: 49 volume-title: Algorithm Design for Computer System Design year: 1984 ident: 6479_CR46 – start-page: 188 volume-title: Proceedings of the 1994 ACM Symposium on Applied Computing year: 1994 ident: 6479_CR75 doi: 10.1145/326619.326694 – volume-title: Vychislitel’nye mashiny i trudnoreshaemye zadachi (Computing Machines and Hard-To-Solve Problems) year: 1982 ident: 6479_CR11 – start-page: 134 volume-title: Methodologies for Intelligent Systems year: 1994 ident: 6479_CR76 doi: 10.1007/3-540-58495-1_14 – volume-title: Packaging models in multi-criteria decision-making problems with limited resources year: 1986 ident: 6479_CR9 – volume: 8 start-page: 463 year: 2001 ident: 6479_CR31 publication-title: Nordic J. Comput. – volume: 60 start-page: 1491 issue: 6 year: 2012 ident: 6479_CR8 publication-title: Oper. Res. doi: 10.1287/opre.1120.1109 – volume: 27 start-page: 207 issue: 2 year: 1980 ident: 6479_CR52 publication-title: J. Assoc. Comput. Mach. doi: 10.1145/322186.322187 – start-page: 250 volume-title: Artificial Neural Nets and Genetic Algorithms year: 1998 ident: 6479_CR77 doi: 10.1007/978-3-7091-6492-1_55 – volume: 11 start-page: 156 issue: 4–5 year: 1980 ident: 6479_CR53 publication-title: Inf. Process. Lett. doi: 10.1016/0020-0190(80)90041-1 – volume: 26 start-page: 1 issue: 1 year: 1980 ident: 6479_CR45 publication-title: Manage. Sci. doi: 10.1287/mnsc.26.1.1 – start-page: 13 volume-title: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms year: 2014 ident: 6479_CR24 doi: 10.1137/1.9781611973402.2 – volume: 3 start-page: 275 year: 1981 ident: 6479_CR63 publication-title: Discrete Appl. Math. doi: 10.1016/0166-218X(81)90005-6 – volume: 5 start-page: 287 year: 1979 ident: 6479_CR5 publication-title: Ann. Discrete Math. doi: 10.1016/S0167-5060(08)70356-X – volume: 12 start-page: 34 year: 1997 ident: 6479_CR16 publication-title: Izv. Vyssh. Uch. Zaved., Mat. – volume: 3 start-page: 7 year: 2007 ident: 6479_CR38 publication-title: Inf. Tekhnol. Vychisl. Sist. – start-page: 221 volume-title: Knapsack Problems: Algorithms and Computer Implementations year: 1990 ident: 6479_CR56 – volume: 1 start-page: 169 year: 1977 ident: 6479_CR65 publication-title: EJOR doi: 10.1016/0377-2217(77)90024-8 – volume: 2 start-page: 514 year: 2008 ident: 6479_CR42 publication-title: Frederic Adam, Ed., Hershey – start-page: 423 volume-title: J. Oper. Res. Soc. year: 1987 ident: 6479_CR15 – volume-title: Kachestvennye metody prinyatiya reshenii (Qualitative Methods of Decision-Making) year: 1996 ident: 6479_CR41 – volume: 2 start-page: 5 issue: 1 year: 1996 ident: 6479_CR69 publication-title: J. Heuristics doi: 10.1007/BF00226291 – volume-title: Improved bin completion for optimal bin packing and number partitioning year: 2013 ident: 6479_CR62 – volume: 8 start-page: 202 issue: 2 year: 1979 ident: 6479_CR4 publication-title: SIAM J. Comput. doi: 10.1137/0208016 – volume: 3 start-page: 66 issue: 1 year: 1982 ident: 6479_CR14 publication-title: SIAM J. Algebraic Discrete Methods doi: 10.1137/0603007 – volume: 28 start-page: 59 year: 1990 ident: 6479_CR57 publication-title: Discrete Appl. Math. doi: 10.1016/0166-218X(90)90094-S – volume: 141 start-page: 410 issue: 2 year: 2002 ident: 6479_CR20 publication-title: EJOR doi: 10.1016/S0377-2217(02)00134-0 – volume: 28 start-page: 393 year: 2007 ident: 6479_CR61 publication-title: J. Artif. Intell. Res. doi: 10.1613/jair.2106 – start-page: 1 volume-title: Algorithmica year: 2014 ident: 6479_CR32 – volume: 4 start-page: 276 issue: 4 year: 1980 ident: 6479_CR1 publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(80)90112-5 – volume: 12 start-page: 227 year: 1993 ident: 6479_CR29 publication-title: SIAM J. Comput. doi: 10.1137/0212014 – volume: 206 start-page: 241 issue: 1 year: 2013 ident: 6479_CR27 publication-title: Ann. Oper. Res. doi: 10.1007/s10479-013-1341-4 – volume: 42 start-page: 481 issue: 6 year: 2015 ident: 6479_CR40 publication-title: Sci. Tech. Inf. Process. doi: 10.3103/S0147688215060064 – start-page: 202 volume-title: Proceedings of an International Conference on Genetic Algorithms and Their Applications year: 1985 ident: 6479_CR66 – start-page: 731 volume-title: AAAI/IAAI year: 2002 ident: 6479_CR58 |
| SSID | ssj0056249 |
| Score | 2.0396335 |
| Snippet | A new formulation of the reverse bin-packing problem is suggested. One distinct feature of the new formulation is that it takes into account of a... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 440 |
| SubjectTerms | Computer Science Computer Systems Organization and Communication Networks Decision making Decision theory Knapsack problem Multiple criteria decision making Multiple criterion Qualitative research |
| SummonAdditionalLinks | – databaseName: SpringerLink Journals (ICM) dbid: U2A link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFH_ovHjxYypON8lBPCjBtkma7CQqjiEoOzjYrTRNCoJ0stX_35c2cfgJQnvKSw4vH7_fS94HwKm2LBfauKoBJadc65QqoRjVcYrwWholhIsdfnhMx1N-PxMzH8e9DN7u4UmyOakbuzJil84NCbmxSpqEL4ic67Ah0HR3flzT5Docv4jnLedFaerE26fMn4f4DEYrhvnlUbTBmtEObHmSSK7bWd2FNVt1YTsUYCB-P3Zh4KMOyBnxYUVOzaF9D65wERCXSWOxtOTmuaKTvHBX42TSlpEheGy4exhSz0mbTKNJA05c_QO3MvdhOrp7uh1TXzGBFizlNVVGDofFMC-URlWXRlg04OJSWcYZj6zUiYkLI4VEAWZQC7JkiF1pzkpEfinZAXSqeWUPgehIlfjnluPHpMahjY6HCimNyXOe9CAKqssKn07cVbV4ydCscNrOvmm7B-cfXV7bXBp_CffDfGR-Wy0zZCvKVQsScQ8uwhytmn8d7Ohf0sewmTjwbpxW-tCpF292gNSj1ifNUnsHGy7K9g priority: 102 providerName: Springer Nature |
| Title | The Inverse Bin-Packing Problem Subject to Qualitative Criteria |
| URI | https://link.springer.com/article/10.3103/S0147688217060065 https://www.proquest.com/docview/2018962751 |
| Volume | 44 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3fS8MwED50e_FF_InTbeRBfFCC65I22dPYZHMo6hAH-lSaJgVBtrnN_9-7NnWiKLR9SNNA75L7LpfkPoBT40QSGkusAZnk0piI61ALboII4TWzOgzp7PDdfTSayJvn8NkH3JZ-W2VpE3NDbWcpxchxkh5oIooJg-78nRNrFK2uegqNTaiiCda6AtX-4H78WNpiBPfCAQ6k4hE6k8W6JnFrXdK2JkVleQKZFqHLd2Rau5s_Vkhz4BnuwLb3GFmvUPEubLjpHjT8eQN2xvyBIhIw8yN1H7qofkY5NBZLx_qvUz5OUgqKs3FBIMPQYFAEhq1mrEijkScAZ8R8QH3yACbDwdPViHuuBJ6KSK64tqrTSTtJqg0KObOhw6lbkGknpJAtp0zbBqlVocIKwuIvq0ygyKJEZIj5SolDqExnU3cEzLR0hnfiJF5CGWzamqCj0ZmxSSLbNWiVcopTn0ic-CzeYpxQkGjjX6KtwfnXJ_Mii8Z_leul8GM_oJbxWv01uCgVsn79Z2PH_zd2Alttwul8f0odKqvFh2ugl7EyTdjUw-smVHvXL7eDpu9YWHoXPOBz0u59ArL9znw |
| linkProvider | ProQuest |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT8MwDLZ4HOCCeIrxzAE4gCLaJm2yA0K8xoBt2gEkbqVpUgkJbcCGEH-K34jdB0MguCG1lzaNKsexPyexP4At40QSGkusAZnk0piI61ALbvwI3WtmdRhS7nC7EzVv5OVteDsG71UuDB2rrGxibqhtP6U1cgzSfU1EMaF_-PjEiTWKdlcrCo1CLa7c2yuGbIODi1Mc3-0gaJxdnzR5ySrAUxHJIddW1etpPUm1wd_JbOgwyPEz7YQU0nPKBNZPrQoVNhDWV57KBNr3KBEZekelBPY7DpNSoCenzPTGeWX5EUoUcNuXikcIXYtdVGLy2qdDVIqe5eVqPPJlX_3gCNx-24_N3VxjFmZKfMqOCoWagzHXm4f1MruB7bAyfYmGk5V2YQEOUdkYVex4Hjh2fN_j3SSlJXjWLehqGJonWu9hwz4rinbk5cYZ8SzQDFiEm3-R4RJM9Po9twzMeDrDO3ESL6EMdm2NX9cInWySyKAGXiWnOC3LlhN7xkOM4QuJNv4h2hrsfn7yWNTs-KvxWiX8uJy-g3ikbDXYqwZk9PrXzlb-7mwTpprX7VbcuuhcrcJ0QAghPxmzBhPD5xe3jvhmaDZypWJw999a_AHd2AR- |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB60gnjxURWrre5BPCihSXaTbE5SH6W-Sg8WegvZ7C4IkpY2_n9nk43FJwjJKZM9zM7ufPuY7wM4FYqmgZBGNUAzhwkROjzg1BFeiOlVSx4Epnb4aRgOxux-Ekyszumivu1eH0lWNQ2GpSkvujOpu-Ua06VdcyUJcTL3S_IXzKKrsMZMMTAG9Njv1VMx5vYK_6K1Y8yrY82fm_icmJZo88sBaZl3-tuwaQEj6VU9vAMrKm_CVi3GQOzYbELHViCQM2JLjIzL6--7cIkBQQyrxnyhyNVL7ozSzGyTk1ElKUNwCjF7MqSYkopYo6QEJ0YLwUTpHoz7t8_XA8eqJzgZDVnhcBnFcRanGRfodi0DhYs5T3NFGWWuioQvvUxGQYQGVKIXIk0xj4Up1YgCoojuQyOf5uoAiHC5xjdVDB8aCWxaCi_mCG9kmjK_BW7tuiSz1OJG4eI1wSWG8XbyzdstOP_4ZVbxavxl3K77I7FDbJEgcuFGOSjwWnBR99Hy86-NHf7L-gTWRzf95PFu-HAEG77J6eVdljY0ivmb6iAiKcRxGXXvHanSHA |
| 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=The+Inverse+Bin-Packing+Problem+Subject+to+Qualitative+Criteria&rft.jtitle=Scientific+and+technical+information+processing&rft.au=Furems%2C+E+M&rft.date=2017-12-01&rft.pub=Springer+Nature+B.V&rft.issn=0147-6882&rft.eissn=1934-8118&rft.volume=44&rft.issue=6&rft.spage=440&rft.epage=449&rft_id=info:doi/10.3103%2FS0147688217060065 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0147-6882&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0147-6882&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0147-6882&client=summon |