A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments
•We define a novel type of nonseparable multidimensional knapsack problem.•The new knapsack problem arises in the statistical design of mixture experiments.•We propose a variable descent algorithm to compute D- and I-optimal designs.•We also propose a mixed integer nonlinear programming formulation....
Gespeichert in:
| Veröffentlicht in: | European journal of operational research Jg. 281; H. 1; S. 201 - 221 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
16.02.2020
|
| Schlagworte: | |
| ISSN: | 0377-2217, 1872-6860 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | •We define a novel type of nonseparable multidimensional knapsack problem.•The new knapsack problem arises in the statistical design of mixture experiments.•We propose a variable descent algorithm to compute D- and I-optimal designs.•We also propose a mixed integer nonlinear programming formulation.•We study designs for first-order and second-order Scheffé regression models.
Mixture experiments usually involve various constraints on the proportions of the ingredients of the mixture under study. In this paper, inspired by the fact that the available stock of certain ingredients is often limited, we focus on a new type of constraint, which we refer to as an ingredient availability constraint. This type of constraint substantially complicates the search for optimal designs for mixture experiments. One difficulty, for instance, is that the optimal number of experimental runs is not known a priori. The resulting optimal experimental design problem belongs to the class of nonlinear nonseparable multidimensional knapsack problems. We present a variable neighborhood search algorithm as well as a mixed integer nonlinear programming approach to tackle the problem to identify D- and I-optimal designs for mixture experiments when there is a limited stock of certain ingredients, and we show that the variable neighborhood search algorithm is highly competitive in terms of solution quality and computing time. |
|---|---|
| AbstractList | •We define a novel type of nonseparable multidimensional knapsack problem.•The new knapsack problem arises in the statistical design of mixture experiments.•We propose a variable descent algorithm to compute D- and I-optimal designs.•We also propose a mixed integer nonlinear programming formulation.•We study designs for first-order and second-order Scheffé regression models.
Mixture experiments usually involve various constraints on the proportions of the ingredients of the mixture under study. In this paper, inspired by the fact that the available stock of certain ingredients is often limited, we focus on a new type of constraint, which we refer to as an ingredient availability constraint. This type of constraint substantially complicates the search for optimal designs for mixture experiments. One difficulty, for instance, is that the optimal number of experimental runs is not known a priori. The resulting optimal experimental design problem belongs to the class of nonlinear nonseparable multidimensional knapsack problems. We present a variable neighborhood search algorithm as well as a mixed integer nonlinear programming approach to tackle the problem to identify D- and I-optimal designs for mixture experiments when there is a limited stock of certain ingredients, and we show that the variable neighborhood search algorithm is highly competitive in terms of solution quality and computing time. |
| Author | Goos, P. Sartono, B. Vazquez, A.R. Syafitri, U. |
| Author_xml | – sequence: 1 givenname: P. orcidid: 0000-0002-3854-6506 surname: Goos fullname: Goos, P. email: peter.goos@kuleuven.be organization: Faculty of Bioscience Engineering & Leuven Statistics Research Centre (LStat), KU Leuven, Belgium – sequence: 2 givenname: U. surname: Syafitri fullname: Syafitri, U. organization: Department of Statistics, Bogor Agricultural University, Indonesia – sequence: 3 givenname: B. surname: Sartono fullname: Sartono, B. organization: Department of Statistics, Bogor Agricultural University, Indonesia – sequence: 4 givenname: A.R. surname: Vazquez fullname: Vazquez, A.R. organization: Faculty of Bioscience Engineering & Leuven Statistics Research Centre (LStat), KU Leuven, Belgium |
| BookMark | eNp9kL1OwzAUhS1UJNrCCzD5BRKukzhxJZaq4k-qxAILi-U41-A2cSLbReXtSVQmhk53uPqOzvkWZOZ6h4TcMkgZsPJul-Ku92kGbJWCSCGDCzJnosqSUpQwI3PIqyrJMlZdkUUIOwBgnPE5-VjTMaq1DpWn3aGNtrEdumB7p1q6d2oISu_p4Pu6xY5aR-MX0n6Ithv_DQb76WhvaGeP8eCR4nFAPyXEcE0ujWoD3vzdJXl_fHjbPCfb16eXzXqb6LzkMalqBpngOheG50VWwqrh3ORNBdBAUYu6FnwlEEutTW4E6kbkvNaFKYq6hsrkS5KdcrXvQ_Bo5DA2UP5HMpCTHbmTkx052ZEg5GhnhMQ_SNuo4jg7emXb8-j9CcVx1LdFL4O26DQ21qOOsuntOfwXGmqE_A |
| CitedBy_id | crossref_primary_10_1016_j_chemolab_2021_104395 crossref_primary_10_1016_j_chemolab_2024_105305 crossref_primary_10_1109_TMC_2023_3273293 crossref_primary_10_1155_2022_7299086 crossref_primary_10_1016_j_chemolab_2021_104400 crossref_primary_10_1016_j_ejor_2025_04_019 crossref_primary_10_1016_j_renene_2020_11_012 crossref_primary_10_1109_TMC_2024_3419915 crossref_primary_10_3390_math13182950 crossref_primary_10_1016_j_sysarc_2022_102744 crossref_primary_10_1016_j_cor_2021_105693 crossref_primary_10_1016_j_cie_2020_106742 crossref_primary_10_1109_TWC_2024_3400523 crossref_primary_10_1016_j_jocm_2025_100551 crossref_primary_10_1016_j_adhoc_2020_102216 crossref_primary_10_1016_j_eswa_2023_120771 |
| Cites_doi | 10.1016/j.foodqual.2011.04.006 10.1016/j.jspi.2008.05.014 10.1080/00401706.2018.1473798 10.1111/j.2517-6161.1972.tb00896.x 10.1016/0378-3758(89)90023-2 10.1287/mnsc.22.10.1147 10.1016/j.dam.2005.05.020 10.1080/00401706.1995.10485889 10.1111/j.2517-6161.1963.tb00506.x 10.1016/0378-3758(93)90112-J 10.1016/S0377-2217(02)00884-6 10.1016/j.csda.2009.11.014 10.1016/S0377-2217(01)00179-5 10.1016/j.cor.2017.12.017 10.1214/aoms/1177705160 10.1007/s10898-007-9218-1 10.1080/00224065.1988.11979093 10.1016/j.cor.2010.12.017 10.1016/j.ejor.2018.10.043 10.1016/j.ejor.2018.09.020 10.1080/00401706.2014.958198 10.1016/j.cor.2018.04.001 10.1016/j.cor.2005.10.010 10.1016/0167-7152(94)00122-O 10.1016/0377-2217(94)00229-0 10.1016/0167-6377(88)90041-7 10.1016/S0377-2217(02)00833-0 10.1016/j.chemolab.2014.04.019 10.1016/0378-3758(93)90072-E 10.1111/j.2517-6161.1958.tb00299.x 10.1007/BFb0120892 10.1111/j.2517-6161.1968.tb01511.x 10.1016/j.ejor.2019.02.011 10.1080/00401706.1977.10489584 10.1080/00224065.2012.11917886 10.1080/01621459.2015.1136632 10.1016/S0377-2217(02)00832-9 10.1109/99.714603 10.1016/S0012-365X(03)00311-X 10.1016/j.mspro.2014.10.038 10.1007/s10878-007-9105-1 10.1016/j.cor.2010.07.010 10.1080/08982110500225364 10.1023/A:1009642405419 10.1080/00224065.2012.11917906 10.1016/S0305-0548(97)00031-2 10.1080/00401706.1983.10487899 10.1016/j.ejor.2016.06.013 10.1111/j.2517-6161.1968.tb01512.x 10.1016/j.chemolab.2018.04.017 10.1080/00224065.2004.11980249 10.1016/j.dam.2006.08.007 |
| ContentType | Journal Article |
| Copyright | 2019 Elsevier B.V. |
| Copyright_xml | – notice: 2019 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ejor.2019.08.020 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 221 |
| ExternalDocumentID | 10_1016_j_ejor_2019_08_020 S0377221719306733 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c365t-7b10285c38f5342609d55f3d700d04b8bb8598ee6ccf3f8ecd835bc4f44bb07f3 |
| ISICitedReferencesCount | 18 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000495480100016&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Tue Nov 18 22:18:45 EST 2025 Sat Nov 29 07:21:48 EST 2025 Fri Feb 23 02:17:46 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Variable neighborhood search (VNS) algorithm Mixed integer nonlinear programming (MINLP) Nonlinear multidimensional knapsack problem Metaheuristics D- and I-optimality |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c365t-7b10285c38f5342609d55f3d700d04b8bb8598ee6ccf3f8ecd835bc4f44bb07f3 |
| ORCID | 0000-0002-3854-6506 |
| PageCount | 21 |
| ParticipantIDs | crossref_primary_10_1016_j_ejor_2019_08_020 crossref_citationtrail_10_1016_j_ejor_2019_08_020 elsevier_sciencedirect_doi_10_1016_j_ejor_2019_08_020 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-02-16 |
| PublicationDateYYYYMMDD | 2020-02-16 |
| PublicationDate_xml | – month: 02 year: 2020 text: 2020-02-16 day: 16 |
| PublicationDecade | 2020 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2020 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Lambrakis (bib0042) 1968; 30 Morin, Marsten (bib0052) 1976; 22 Piepel, Cooley, Jones (bib0054) 2005; 17 Galil, Kiefer (bib0023) 1977; 19 Mitchell (bib0049) 1974; 16 Avanthay, Hertz, Zufferey (bib0003) 2003; 151 Mikaeili (bib0047) 1989; 21 Schauer (bib0061) 2016; 255 Ruseckaite, Goos, Fok (bib0058) 2017; 66 Sahinidis, N. V. (2017). BARON 17.8.9: Global Optimization of Mixed-Integer Nonlinear Programs, User’s Manual. Vuchkov, Donev (bib0068) 1985 Goos (bib0027) 2002 Scheffé (bib0062) 1958; 20 Mladenović, Hansen (bib0050) 1997; 24 Hardin, Sloane (bib0033) 1993; 37 Wynn (bib0070) 1972; 34 Goos, Jones, Syafitri (bib0029) 2016; 111 Vazquez, Goos, Schoen (bib0066) 2019; 61 Gallo, Hammer, Simeone (bib0024) 1980; 12 Kiefer (bib0038) 1961; 32 Atkinson, Donev, Tobias (bib0002) 2007 Huang, Gilmour, Mylona, Goos (bib0034) 2019; 68 Vo-Thanh, Jans, Schoen, Goos (bib0067) 2018; 97 Lambrakis (bib0041) 1968; 30 Djerdjour, Mathur, Salkin (bib0018) 1988; 7 Sartono, Goos, Schoen (bib0060) 2015; 57 D’Ambrosio, Martello, Mencarelli (bib0014) 2018; 93 Czyzyk, Mesnier, Moré (bib0012) 1998; 5 Kytöjoki, Nuortio, Bräysy, Gendreau (bib0039) 2007; 34 Dell’Amico, Delorme, Iori, Martello (bib0017) 2019; 274 Arnouts, Goos (bib0001) 2010; 54 Fedorov (bib0020) 1972 Chu, Beasley (bib0009) 1998; 4 Gleixner, Bastubbe, Eifler, Gally, Gamrath, Gottwald (bib0026) 2018 Cornell (bib0011) 2002 Uranisi (bib0065) 1964 Goos, Syafitri (bib0030) 2014; 136 Quadri, Soutif, Tolla (bib0057) 2009; 17 Bretthauer, Shetty (bib0007) 2002; 138 Goos, Jones (bib0028) 2011 Duarte, Granajo, Wong (bib0019) 2019 Hansen, Mladenović (bib0032) 2006; 154 Meyer, Nachtsheim (bib0046) 1995; 37 Malaguti, Monaci, Paronuzzi, Pferschy (bib0045) 2019; 273 Copelli, Falchi, Ghiselli, Lutero, Osello, Riolo (bib0010) 2018; 178 Pisinger (bib0056) 2007; 155 Nigam, Gupta, Gupta (bib0053) 1983; 25 Mikaeili (bib0048) 1993; 35 Goos, Vandebroek (bib0031) 2004; 36 Mladenović, Petrović, Kovačević-Vujčić, Čangalović (bib0051) 2003; 151 Billionnet, Calmels (bib0005) 1996; 92 De Ketelaere, Goos, Brijs (bib0016) 2011; 22 Liu, Neudecker (bib0044) 1995; 23 Jones, Goos (bib0036) 2012; 44 Piepel (bib0055) 1988; 20 Caporossi, Hansen (bib0008) 2004; 276 D’Ambrosio, Martello (bib0013) 2011; 38 Smith (bib0064) 2005 Laake (bib0040) 1975; 2 De Groot (bib0015) 1970 Scheffé (bib0063) 1963; 25 Becker, Buriol (bib0004) 2019; 277 Brent (bib0006) 1973 Garroi, Goos, Sörensen (bib0025) 2009; 139 Kellerer, Pferschy, Pisinger (bib0037) 2010 Wang, Kochenberger, Glover (bib0069) 2012; 39 Fleszar, Hindi (bib0021) 2004; 155 Jones, Goos (bib0035) 2012; 44 Fleury, Godon, Ayral, Perret, Dussossoy, Gin (bib0022) 2014; 7 Liberti, Lavor, Maculan, Marinelli (bib0043) 2009; 43 Jones (10.1016/j.ejor.2019.08.020_bib0036) 2012; 44 Vo-Thanh (10.1016/j.ejor.2019.08.020_bib0067) 2018; 97 D’Ambrosio (10.1016/j.ejor.2019.08.020_bib0013) 2011; 38 Wynn (10.1016/j.ejor.2019.08.020_bib0070) 1972; 34 Garroi (10.1016/j.ejor.2019.08.020_bib0025) 2009; 139 Kytöjoki (10.1016/j.ejor.2019.08.020_bib0039) 2007; 34 Scheffé (10.1016/j.ejor.2019.08.020_bib0063) 1963; 25 Billionnet (10.1016/j.ejor.2019.08.020_bib0005) 1996; 92 Nigam (10.1016/j.ejor.2019.08.020_bib0053) 1983; 25 Liberti (10.1016/j.ejor.2019.08.020_bib0043) 2009; 43 Mladenović (10.1016/j.ejor.2019.08.020_bib0051) 2003; 151 Bretthauer (10.1016/j.ejor.2019.08.020_bib0007) 2002; 138 Gallo (10.1016/j.ejor.2019.08.020_bib0024) 1980; 12 Hansen (10.1016/j.ejor.2019.08.020_bib0032) 2006; 154 Goos (10.1016/j.ejor.2019.08.020_bib0029) 2016; 111 Lambrakis (10.1016/j.ejor.2019.08.020_bib0042) 1968; 30 Liu (10.1016/j.ejor.2019.08.020_bib0044) 1995; 23 Laake (10.1016/j.ejor.2019.08.020_bib0040) 1975; 2 Scheffé (10.1016/j.ejor.2019.08.020_bib0062) 1958; 20 Chu (10.1016/j.ejor.2019.08.020_bib0009) 1998; 4 Vuchkov (10.1016/j.ejor.2019.08.020_sbref0067) 1985 Dell’Amico (10.1016/j.ejor.2019.08.020_bib0017) 2019; 274 Goos (10.1016/j.ejor.2019.08.020_bib0030) 2014; 136 Huang (10.1016/j.ejor.2019.08.020_bib0034) 2019; 68 Kellerer (10.1016/j.ejor.2019.08.020_bib0037) 2010 Quadri (10.1016/j.ejor.2019.08.020_bib0057) 2009; 17 Becker (10.1016/j.ejor.2019.08.020_bib0004) 2019; 277 Pisinger (10.1016/j.ejor.2019.08.020_bib0056) 2007; 155 Duarte (10.1016/j.ejor.2019.08.020_bib0019) 2019 Caporossi (10.1016/j.ejor.2019.08.020_bib0008) 2004; 276 Meyer (10.1016/j.ejor.2019.08.020_bib0046) 1995; 37 Ruseckaite (10.1016/j.ejor.2019.08.020_bib0058) 2017; 66 Hardin (10.1016/j.ejor.2019.08.020_bib0033) 1993; 37 Mladenović (10.1016/j.ejor.2019.08.020_bib0050) 1997; 24 Mikaeili (10.1016/j.ejor.2019.08.020_bib0047) 1989; 21 Morin (10.1016/j.ejor.2019.08.020_bib0052) 1976; 22 De Ketelaere (10.1016/j.ejor.2019.08.020_bib0016) 2011; 22 Goos (10.1016/j.ejor.2019.08.020_bib0031) 2004; 36 Avanthay (10.1016/j.ejor.2019.08.020_bib0003) 2003; 151 Copelli (10.1016/j.ejor.2019.08.020_bib0010) 2018; 178 Vazquez (10.1016/j.ejor.2019.08.020_bib0066) 2019; 61 Piepel (10.1016/j.ejor.2019.08.020_bib0055) 1988; 20 Fleszar (10.1016/j.ejor.2019.08.020_bib0021) 2004; 155 Mitchell (10.1016/j.ejor.2019.08.020_bib0049) 1974; 16 Cornell (10.1016/j.ejor.2019.08.020_bib0011) 2002 Fleury (10.1016/j.ejor.2019.08.020_bib0022) 2014; 7 Wang (10.1016/j.ejor.2019.08.020_bib0069) 2012; 39 Galil (10.1016/j.ejor.2019.08.020_bib0023) 1977; 19 Schauer (10.1016/j.ejor.2019.08.020_bib0061) 2016; 255 Fedorov (10.1016/j.ejor.2019.08.020_bib0020) 1972 Uranisi (10.1016/j.ejor.2019.08.020_bib0065) 1964 Djerdjour (10.1016/j.ejor.2019.08.020_bib0018) 1988; 7 Gleixner (10.1016/j.ejor.2019.08.020_bib0026) 2018 D’Ambrosio (10.1016/j.ejor.2019.08.020_bib0014) 2018; 93 Goos (10.1016/j.ejor.2019.08.020_bib0028) 2011 Jones (10.1016/j.ejor.2019.08.020_bib0035) 2012; 44 Goos (10.1016/j.ejor.2019.08.020_bib0027) 2002 Arnouts (10.1016/j.ejor.2019.08.020_bib0001) 2010; 54 Sartono (10.1016/j.ejor.2019.08.020_bib0060) 2015; 57 Brent (10.1016/j.ejor.2019.08.020_bib0006) 1973 Piepel (10.1016/j.ejor.2019.08.020_bib0054) 2005; 17 10.1016/j.ejor.2019.08.020_bib0059 Czyzyk (10.1016/j.ejor.2019.08.020_sbref0012) 1998; 5 Atkinson (10.1016/j.ejor.2019.08.020_bib0002) 2007 De Groot (10.1016/j.ejor.2019.08.020_bib0015) 1970 Smith (10.1016/j.ejor.2019.08.020_bib0064) 2005 Kiefer (10.1016/j.ejor.2019.08.020_bib0038) 1961; 32 Mikaeili (10.1016/j.ejor.2019.08.020_bib0048) 1993; 35 Lambrakis (10.1016/j.ejor.2019.08.020_bib0041) 1968; 30 Malaguti (10.1016/j.ejor.2019.08.020_bib0045) 2019; 273 |
| References_xml | – volume: 139 start-page: 30 year: 2009 end-page: 44 ident: bib0025 article-title: A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation publication-title: Journal of Statistical Planning and Inference – volume: 61 start-page: 219 year: 2019 end-page: 232 ident: bib0066 article-title: Constructing two-level designs by concatenation of strength-3 orthogonal arrays publication-title: Technometrics – volume: 22 start-page: 1147 year: 1976 end-page: 1158 ident: bib0052 article-title: An algorithm for nonlinear knapsack problems publication-title: Management Science – volume: 255 start-page: 357 year: 2016 end-page: 363 ident: bib0061 article-title: Asymptotic behavior of the quadratic knapsack problem publication-title: European Journal of Operational Research – volume: 93 start-page: 79 year: 2018 end-page: 89 ident: bib0014 article-title: Relaxations and heuristics for the multiple non-linear separable knapsack problem publication-title: Computers and Operations Research – volume: 178 start-page: 24 year: 2018 end-page: 31 ident: bib0010 article-title: Sequential “asymmetric” D-optimal designs: a practical solution in case of limited resources and not equally expensive experiments publication-title: Chemometrics and Intelligent Laboratory Systems – volume: 154 start-page: 802 year: 2006 end-page: 817 ident: bib0032 article-title: First vs. best improvement: an empirical study publication-title: Discrete Applied Mathematics – volume: 7 start-page: 253 year: 1988 end-page: 258 ident: bib0018 article-title: A surrogate relaxation based algorithm for a general quadratic multi-dimensional knapsack problem publication-title: Operations Research Letters – year: 1972 ident: bib0020 article-title: Theory of optimal experiments – volume: 66 start-page: 363 year: 2017 end-page: 386 ident: bib0058 article-title: Bayesian D-optimal choice designs for mixtures publication-title: Journal of the Royal Statistical Society: Series C (Applied Statistics) – volume: 57 start-page: 488 year: 2015 end-page: 502 ident: bib0060 article-title: Constructing general orthogonal fractional factorial split-plot designs publication-title: Technometrics – volume: 274 start-page: 886 year: 2019 end-page: 899 ident: bib0017 article-title: Mathematical models and decomposition methods for the multiple knapsack problem publication-title: European Journal of Operational Research – volume: 25 start-page: 235 year: 1963 end-page: 263 ident: bib0063 article-title: The simplex-centroid design for experiments with mixtures publication-title: Journal of the Royal Statistical Society, Series B – volume: 273 start-page: 874 year: 2019 end-page: 888 ident: bib0045 article-title: Integer optimization with penalized fractional values: the knapsack case publication-title: European Journal of Operational Research – volume: 35 start-page: 121 year: 1993 end-page: 130 ident: bib0048 article-title: D-optimum design for full cubic on q-simplex publication-title: Journal of Statistical Planning and Inference – volume: 97 start-page: 96 year: 2018 end-page: 110 ident: bib0067 article-title: Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs publication-title: Computers and Operations Research – year: 1985 ident: bib0068 article-title: D-optimal designs generation for large number of variables publication-title: Proceedings of the forty-fifth session of the International Statistical Institute – volume: 34 start-page: 133 year: 1972 end-page: 147 ident: bib0070 article-title: Results in the theory and construction of D-optimum experimental designs publication-title: Journal of the Royal Statistical Society, Series B – volume: 2 start-page: 153 year: 1975 end-page: 157 ident: bib0040 article-title: On the optimal allocation of observation in experiments with mixtures publication-title: Scandinavian Journal of Statistics – volume: 151 start-page: 379 year: 2003 end-page: 388 ident: bib0003 article-title: A variable neighborhood search for graph coloring publication-title: European Journal of Operational Research – volume: 136 start-page: 173 year: 2014 end-page: 178 ident: bib0030 article-title: V-optimal mixture designs for the qth degree model publication-title: Chemometrics and Intelligent Laboratory Systems – volume: 54 start-page: 3381 year: 2010 end-page: 3391 ident: bib0001 article-title: Update formulas for split-plot and block designs publication-title: Computational Statistics and Data Analysis – volume: 5 start-page: 68 year: 1998 end-page: 75 ident: bib0012 article-title: The NEOS server publication-title: IEEE Journal on Computational Science and Engineering – volume: 155 start-page: 402 year: 2004 end-page: 413 ident: bib0021 article-title: Solving the resource-constrained project scheduling problem by a variable neighbourhood search publication-title: European Journal of Operational Research – volume: 30 start-page: 137 year: 1968 end-page: 144 ident: bib0042 article-title: Experiments with p-component mixtures publication-title: Journal of Royal Statistical Society, Series B – volume: 20 start-page: 344 year: 1958 end-page: 360 ident: bib0062 article-title: Experiments with mixtures publication-title: Journal of the Royal Statistical Society, Series B – volume: 36 start-page: 12 year: 2004 end-page: 26 ident: bib0031 article-title: Outperforming completely randomized designs publication-title: Journal of Quality Technology – volume: 37 start-page: 60 year: 1995 end-page: 69 ident: bib0046 article-title: The coordinate-exchange algorithm for constructing exact optimal experimental designs publication-title: Technometrics – year: 2005 ident: bib0064 article-title: Experimental design for formulation – reference: Sahinidis, N. V. (2017). BARON 17.8.9: Global Optimization of Mixed-Integer Nonlinear Programs, User’s Manual. – volume: 277 start-page: 84 year: 2019 end-page: 99 ident: bib0004 article-title: An empirical analysis of exact algorithms for the unbounded knapsack problem publication-title: European Journal of Operational Research – volume: 21 start-page: 107 year: 1989 end-page: 115 ident: bib0047 article-title: D-optimum design for cubic without 3-way effect on the simplex publication-title: Journal of Statistical Planning and Inference – volume: 24 start-page: 1097 year: 1997 end-page: 1100 ident: bib0050 article-title: Variable neighborhood search publication-title: Computers and Operations Research – volume: 32 start-page: 298 year: 1961 end-page: 325 ident: bib0038 article-title: Optimum design in regression problems II publication-title: Annals of Mathematical Statistics – volume: 138 start-page: 459 year: 2002 end-page: 472 ident: bib0007 article-title: The nonlinear knapsack problem – algorithms and applications publication-title: European Journal of Operational Research – volume: 20 start-page: 125 year: 1988 end-page: 139 ident: bib0055 article-title: Programs for generating extreme vertices and centroids of linearly constrained experimental regions publication-title: Journal of Quality Technology – volume: 276 start-page: 81 year: 2004 end-page: 94 ident: bib0008 article-title: Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures publication-title: Discrete Mathematics – volume: 38 start-page: 505 year: 2011 end-page: 513 ident: bib0013 article-title: Heuristic algorithms for the general nonlinear separable knapsack problem publication-title: Computers and Operations Research – year: 1973 ident: bib0006 article-title: Algorithms for minimization without derivatives – volume: 43 start-page: 207 year: 2009 end-page: 218 ident: bib0043 article-title: Double variable neighbourhood search with smoothing for the molecular distance geometry problem publication-title: Journal of Global Optimization – volume: 17 start-page: 579 year: 2005 end-page: 594 ident: bib0054 article-title: Construction of a 21-component layered mixture experiment design using a new mixture coordinate-exchange algorithm publication-title: Quality Engineering – year: 2010 ident: bib0037 article-title: Knapsack problems – year: 2011 ident: bib0028 article-title: Design of experiments: A case-study approach – volume: 68 start-page: 623 year: 2019 end-page: 640 ident: bib0034 article-title: Optimal design of experiments for non-linear response surface models publication-title: Journal of the Royal Statistical Society: Series C (Applied Statistics) – volume: 30 start-page: 123 year: 1968 end-page: 136 ident: bib0041 article-title: Experiments with mixtures: A generalization of the simplex-lattice design publication-title: Journal of Royal Statistical Society, Series B – volume: 17 start-page: 157 year: 2009 end-page: 167 ident: bib0057 article-title: Exact solution method to solve large scale integer quadratic multidimensional knapsack problems publication-title: Journal of Combinatorial Optimization – volume: 25 start-page: 367 year: 1983 end-page: 371 ident: bib0053 article-title: A new algorithm for extreme vertices designs for linear mixture models publication-title: Technometrics – year: 2002 ident: bib0011 article-title: Experiments with mixtures: Designs, models, and the analysis of mixture data – volume: 39 start-page: 3 year: 2012 end-page: 11 ident: bib0069 article-title: A computational study on the quadratic knapsack problem with multiple constraints publication-title: Computers and Operations Research – volume: 34 start-page: 2743 year: 2007 end-page: 2757 ident: bib0039 article-title: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems publication-title: Computers and Operations Research – year: 1970 ident: bib0015 article-title: Optimal statistical decisions – volume: 92 start-page: 310 year: 1996 end-page: 325 ident: bib0005 article-title: Linear programming for the 0-1 quadratic knapsack problem publication-title: European Journal of Operational Research – volume: 16 start-page: 203 year: 1974 end-page: 210 ident: bib0049 article-title: An algorithm for the construction of D-optimal experimental designs publication-title: Technometrics – year: 2019 ident: bib0019 article-title: Optimal exact designs of experiments via mixed integer nonlinear programming publication-title: Statistics and Computing – year: 2018 ident: bib0026 article-title: The SCIP Optimization Suite 6.0 publication-title: Technical Report – volume: 37 start-page: 339 year: 1993 end-page: 369 ident: bib0033 article-title: A new approach to construction of optimal designs publication-title: Journal of Statistical Planning and Inference – volume: 4 start-page: 63 year: 1998 end-page: 86 ident: bib0009 article-title: A genetic algorithm for the multidimensional knapsack problem publication-title: Journal of Heuristics – year: 2002 ident: bib0027 article-title: The optimal design of blocked and split-plot experiments – volume: 151 start-page: 389 year: 2003 end-page: 399 ident: bib0051 article-title: Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search publication-title: European Journal of Operational Research – volume: 155 start-page: 623—648 year: 2007 ident: bib0056 article-title: The quadratic knapsack problem—a survey publication-title: Discrete Applied Mathematics – volume: 12 start-page: 132 year: 1980 end-page: 149 ident: bib0024 article-title: Quadratic knapsack problems publication-title: Mathematical Programming Studies – year: 1964 ident: bib0065 article-title: Optimal design for the special cubic regression model on the publication-title: Mathematical Report – volume: 111 start-page: 899 year: 2016 end-page: 911 ident: bib0029 article-title: I-optimal design of mixture experiments publication-title: Journal of the American Statistical Association – volume: 44 start-page: 85 year: 2012 end-page: 101 ident: bib0036 article-title: I-optimal versus D-optimal split-plot response-surface designs publication-title: Journal of Quality Technology – volume: 23 start-page: 253 year: 1995 end-page: 258 ident: bib0044 article-title: A V-optimal design for Scheffé’s polynomial model publication-title: Statistics and Probability Letters – year: 2007 ident: bib0002 article-title: Optimum experimental designs, with SAS – volume: 19 start-page: 445 year: 1977 end-page: 453 ident: bib0023 article-title: Comparison of simplex designs for quadratic mixture models publication-title: Technometrics – volume: 44 start-page: 363 year: 2012 end-page: 374 ident: bib0035 article-title: An algorithm for finding D-efficient equivalent-estimation second-order split-plot designs publication-title: Journal of Quality Technology – volume: 22 start-page: 661 year: 2011 end-page: 670 ident: bib0016 article-title: Prespecified factor level combinations in the optimal design of mixture-process variable experiments publication-title: Food Quality and Preference – volume: 7 start-page: 193 year: 2014 end-page: 201 ident: bib0022 article-title: Development of an experimental design to investigate the effects of R7T7 glass composition on the residual rate of alteration publication-title: Procedia Materials Science – volume: 22 start-page: 661 year: 2011 ident: 10.1016/j.ejor.2019.08.020_bib0016 article-title: Prespecified factor level combinations in the optimal design of mixture-process variable experiments publication-title: Food Quality and Preference doi: 10.1016/j.foodqual.2011.04.006 – volume: 66 start-page: 363 year: 2017 ident: 10.1016/j.ejor.2019.08.020_bib0058 article-title: Bayesian D-optimal choice designs for mixtures publication-title: Journal of the Royal Statistical Society: Series C (Applied Statistics) – year: 2010 ident: 10.1016/j.ejor.2019.08.020_bib0037 – year: 2005 ident: 10.1016/j.ejor.2019.08.020_bib0064 – volume: 139 start-page: 30 year: 2009 ident: 10.1016/j.ejor.2019.08.020_bib0025 article-title: A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation publication-title: Journal of Statistical Planning and Inference doi: 10.1016/j.jspi.2008.05.014 – volume: 61 start-page: 219 year: 2019 ident: 10.1016/j.ejor.2019.08.020_bib0066 article-title: Constructing two-level designs by concatenation of strength-3 orthogonal arrays publication-title: Technometrics doi: 10.1080/00401706.2018.1473798 – volume: 34 start-page: 133 year: 1972 ident: 10.1016/j.ejor.2019.08.020_bib0070 article-title: Results in the theory and construction of D-optimum experimental designs publication-title: Journal of the Royal Statistical Society, Series B doi: 10.1111/j.2517-6161.1972.tb00896.x – volume: 21 start-page: 107 year: 1989 ident: 10.1016/j.ejor.2019.08.020_bib0047 article-title: D-optimum design for cubic without 3-way effect on the simplex publication-title: Journal of Statistical Planning and Inference doi: 10.1016/0378-3758(89)90023-2 – volume: 22 start-page: 1147 year: 1976 ident: 10.1016/j.ejor.2019.08.020_bib0052 article-title: An algorithm for nonlinear knapsack problems publication-title: Management Science doi: 10.1287/mnsc.22.10.1147 – volume: 154 start-page: 802 year: 2006 ident: 10.1016/j.ejor.2019.08.020_bib0032 article-title: First vs. best improvement: an empirical study publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2005.05.020 – volume: 37 start-page: 60 year: 1995 ident: 10.1016/j.ejor.2019.08.020_bib0046 article-title: The coordinate-exchange algorithm for constructing exact optimal experimental designs publication-title: Technometrics doi: 10.1080/00401706.1995.10485889 – volume: 25 start-page: 235 year: 1963 ident: 10.1016/j.ejor.2019.08.020_bib0063 article-title: The simplex-centroid design for experiments with mixtures publication-title: Journal of the Royal Statistical Society, Series B doi: 10.1111/j.2517-6161.1963.tb00506.x – volume: 2 start-page: 153 year: 1975 ident: 10.1016/j.ejor.2019.08.020_bib0040 article-title: On the optimal allocation of observation in experiments with mixtures publication-title: Scandinavian Journal of Statistics – year: 1973 ident: 10.1016/j.ejor.2019.08.020_bib0006 – year: 2019 ident: 10.1016/j.ejor.2019.08.020_bib0019 article-title: Optimal exact designs of experiments via mixed integer nonlinear programming publication-title: Statistics and Computing – volume: 37 start-page: 339 year: 1993 ident: 10.1016/j.ejor.2019.08.020_bib0033 article-title: A new approach to construction of optimal designs publication-title: Journal of Statistical Planning and Inference doi: 10.1016/0378-3758(93)90112-J – volume: 155 start-page: 402 year: 2004 ident: 10.1016/j.ejor.2019.08.020_bib0021 article-title: Solving the resource-constrained project scheduling problem by a variable neighbourhood search publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00884-6 – volume: 54 start-page: 3381 year: 2010 ident: 10.1016/j.ejor.2019.08.020_bib0001 article-title: Update formulas for split-plot and block designs publication-title: Computational Statistics and Data Analysis doi: 10.1016/j.csda.2009.11.014 – volume: 138 start-page: 459 year: 2002 ident: 10.1016/j.ejor.2019.08.020_bib0007 article-title: The nonlinear knapsack problem – algorithms and applications publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(01)00179-5 – year: 1970 ident: 10.1016/j.ejor.2019.08.020_bib0015 – volume: 93 start-page: 79 year: 2018 ident: 10.1016/j.ejor.2019.08.020_bib0014 article-title: Relaxations and heuristics for the multiple non-linear separable knapsack problem publication-title: Computers and Operations Research doi: 10.1016/j.cor.2017.12.017 – volume: 32 start-page: 298 year: 1961 ident: 10.1016/j.ejor.2019.08.020_bib0038 article-title: Optimum design in regression problems II publication-title: Annals of Mathematical Statistics doi: 10.1214/aoms/1177705160 – volume: 43 start-page: 207 year: 2009 ident: 10.1016/j.ejor.2019.08.020_bib0043 article-title: Double variable neighbourhood search with smoothing for the molecular distance geometry problem publication-title: Journal of Global Optimization doi: 10.1007/s10898-007-9218-1 – volume: 20 start-page: 125 year: 1988 ident: 10.1016/j.ejor.2019.08.020_bib0055 article-title: Programs for generating extreme vertices and centroids of linearly constrained experimental regions publication-title: Journal of Quality Technology doi: 10.1080/00224065.1988.11979093 – volume: 39 start-page: 3 year: 2012 ident: 10.1016/j.ejor.2019.08.020_bib0069 article-title: A computational study on the quadratic knapsack problem with multiple constraints publication-title: Computers and Operations Research doi: 10.1016/j.cor.2010.12.017 – volume: 274 start-page: 886 year: 2019 ident: 10.1016/j.ejor.2019.08.020_bib0017 article-title: Mathematical models and decomposition methods for the multiple knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2018.10.043 – volume: 273 start-page: 874 year: 2019 ident: 10.1016/j.ejor.2019.08.020_bib0045 article-title: Integer optimization with penalized fractional values: the knapsack case publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2018.09.020 – volume: 57 start-page: 488 year: 2015 ident: 10.1016/j.ejor.2019.08.020_bib0060 article-title: Constructing general orthogonal fractional factorial split-plot designs publication-title: Technometrics doi: 10.1080/00401706.2014.958198 – year: 2011 ident: 10.1016/j.ejor.2019.08.020_bib0028 – volume: 97 start-page: 96 year: 2018 ident: 10.1016/j.ejor.2019.08.020_bib0067 article-title: Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs publication-title: Computers and Operations Research doi: 10.1016/j.cor.2018.04.001 – year: 1972 ident: 10.1016/j.ejor.2019.08.020_bib0020 – year: 2002 ident: 10.1016/j.ejor.2019.08.020_bib0011 – volume: 34 start-page: 2743 year: 2007 ident: 10.1016/j.ejor.2019.08.020_bib0039 article-title: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems publication-title: Computers and Operations Research doi: 10.1016/j.cor.2005.10.010 – volume: 23 start-page: 253 year: 1995 ident: 10.1016/j.ejor.2019.08.020_bib0044 article-title: A V-optimal design for Scheffé’s polynomial model publication-title: Statistics and Probability Letters doi: 10.1016/0167-7152(94)00122-O – volume: 92 start-page: 310 year: 1996 ident: 10.1016/j.ejor.2019.08.020_bib0005 article-title: Linear programming for the 0-1 quadratic knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)00229-0 – volume: 7 start-page: 253 year: 1988 ident: 10.1016/j.ejor.2019.08.020_bib0018 article-title: A surrogate relaxation based algorithm for a general quadratic multi-dimensional knapsack problem publication-title: Operations Research Letters doi: 10.1016/0167-6377(88)90041-7 – volume: 151 start-page: 389 year: 2003 ident: 10.1016/j.ejor.2019.08.020_bib0051 article-title: Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00833-0 – volume: 136 start-page: 173 year: 2014 ident: 10.1016/j.ejor.2019.08.020_bib0030 article-title: V-optimal mixture designs for the qth degree model publication-title: Chemometrics and Intelligent Laboratory Systems doi: 10.1016/j.chemolab.2014.04.019 – volume: 35 start-page: 121 year: 1993 ident: 10.1016/j.ejor.2019.08.020_bib0048 article-title: D-optimum design for full cubic on q-simplex publication-title: Journal of Statistical Planning and Inference doi: 10.1016/0378-3758(93)90072-E – year: 1985 ident: 10.1016/j.ejor.2019.08.020_sbref0067 article-title: D-optimal designs generation for large number of variables – volume: 20 start-page: 344 year: 1958 ident: 10.1016/j.ejor.2019.08.020_bib0062 article-title: Experiments with mixtures publication-title: Journal of the Royal Statistical Society, Series B doi: 10.1111/j.2517-6161.1958.tb00299.x – year: 2018 ident: 10.1016/j.ejor.2019.08.020_bib0026 article-title: The SCIP Optimization Suite 6.0 – volume: 12 start-page: 132 year: 1980 ident: 10.1016/j.ejor.2019.08.020_bib0024 article-title: Quadratic knapsack problems publication-title: Mathematical Programming Studies doi: 10.1007/BFb0120892 – volume: 30 start-page: 123 year: 1968 ident: 10.1016/j.ejor.2019.08.020_bib0041 article-title: Experiments with mixtures: A generalization of the simplex-lattice design publication-title: Journal of Royal Statistical Society, Series B doi: 10.1111/j.2517-6161.1968.tb01511.x – volume: 277 start-page: 84 year: 2019 ident: 10.1016/j.ejor.2019.08.020_bib0004 article-title: An empirical analysis of exact algorithms for the unbounded knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2019.02.011 – volume: 19 start-page: 445 year: 1977 ident: 10.1016/j.ejor.2019.08.020_bib0023 article-title: Comparison of simplex designs for quadratic mixture models publication-title: Technometrics doi: 10.1080/00401706.1977.10489584 – volume: 68 start-page: 623 year: 2019 ident: 10.1016/j.ejor.2019.08.020_bib0034 article-title: Optimal design of experiments for non-linear response surface models publication-title: Journal of the Royal Statistical Society: Series C (Applied Statistics) – volume: 44 start-page: 85 year: 2012 ident: 10.1016/j.ejor.2019.08.020_bib0036 article-title: I-optimal versus D-optimal split-plot response-surface designs publication-title: Journal of Quality Technology doi: 10.1080/00224065.2012.11917886 – year: 2002 ident: 10.1016/j.ejor.2019.08.020_bib0027 – year: 1964 ident: 10.1016/j.ejor.2019.08.020_bib0065 article-title: Optimal design for the special cubic regression model on the q-simplex – volume: 111 start-page: 899 issue: 514 year: 2016 ident: 10.1016/j.ejor.2019.08.020_bib0029 article-title: I-optimal design of mixture experiments publication-title: Journal of the American Statistical Association doi: 10.1080/01621459.2015.1136632 – volume: 151 start-page: 379 year: 2003 ident: 10.1016/j.ejor.2019.08.020_bib0003 article-title: A variable neighborhood search for graph coloring publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00832-9 – volume: 5 start-page: 68 year: 1998 ident: 10.1016/j.ejor.2019.08.020_sbref0012 article-title: The NEOS server publication-title: IEEE Journal on Computational Science and Engineering doi: 10.1109/99.714603 – volume: 276 start-page: 81 year: 2004 ident: 10.1016/j.ejor.2019.08.020_bib0008 article-title: Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures publication-title: Discrete Mathematics doi: 10.1016/S0012-365X(03)00311-X – volume: 7 start-page: 193 year: 2014 ident: 10.1016/j.ejor.2019.08.020_bib0022 article-title: Development of an experimental design to investigate the effects of R7T7 glass composition on the residual rate of alteration publication-title: Procedia Materials Science doi: 10.1016/j.mspro.2014.10.038 – volume: 17 start-page: 157 year: 2009 ident: 10.1016/j.ejor.2019.08.020_bib0057 article-title: Exact solution method to solve large scale integer quadratic multidimensional knapsack problems publication-title: Journal of Combinatorial Optimization doi: 10.1007/s10878-007-9105-1 – volume: 38 start-page: 505 year: 2011 ident: 10.1016/j.ejor.2019.08.020_bib0013 article-title: Heuristic algorithms for the general nonlinear separable knapsack problem publication-title: Computers and Operations Research doi: 10.1016/j.cor.2010.07.010 – ident: 10.1016/j.ejor.2019.08.020_bib0059 – volume: 17 start-page: 579 year: 2005 ident: 10.1016/j.ejor.2019.08.020_bib0054 article-title: Construction of a 21-component layered mixture experiment design using a new mixture coordinate-exchange algorithm publication-title: Quality Engineering doi: 10.1080/08982110500225364 – year: 2007 ident: 10.1016/j.ejor.2019.08.020_bib0002 – volume: 4 start-page: 63 year: 1998 ident: 10.1016/j.ejor.2019.08.020_bib0009 article-title: A genetic algorithm for the multidimensional knapsack problem publication-title: Journal of Heuristics doi: 10.1023/A:1009642405419 – volume: 44 start-page: 363 year: 2012 ident: 10.1016/j.ejor.2019.08.020_bib0035 article-title: An algorithm for finding D-efficient equivalent-estimation second-order split-plot designs publication-title: Journal of Quality Technology doi: 10.1080/00224065.2012.11917906 – volume: 16 start-page: 203 year: 1974 ident: 10.1016/j.ejor.2019.08.020_bib0049 article-title: An algorithm for the construction of D-optimal experimental designs publication-title: Technometrics – volume: 24 start-page: 1097 year: 1997 ident: 10.1016/j.ejor.2019.08.020_bib0050 article-title: Variable neighborhood search publication-title: Computers and Operations Research doi: 10.1016/S0305-0548(97)00031-2 – volume: 25 start-page: 367 year: 1983 ident: 10.1016/j.ejor.2019.08.020_bib0053 article-title: A new algorithm for extreme vertices designs for linear mixture models publication-title: Technometrics doi: 10.1080/00401706.1983.10487899 – volume: 255 start-page: 357 year: 2016 ident: 10.1016/j.ejor.2019.08.020_bib0061 article-title: Asymptotic behavior of the quadratic knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2016.06.013 – volume: 30 start-page: 137 year: 1968 ident: 10.1016/j.ejor.2019.08.020_bib0042 article-title: Experiments with p-component mixtures publication-title: Journal of Royal Statistical Society, Series B doi: 10.1111/j.2517-6161.1968.tb01512.x – volume: 178 start-page: 24 year: 2018 ident: 10.1016/j.ejor.2019.08.020_bib0010 article-title: Sequential “asymmetric” D-optimal designs: a practical solution in case of limited resources and not equally expensive experiments publication-title: Chemometrics and Intelligent Laboratory Systems doi: 10.1016/j.chemolab.2018.04.017 – volume: 36 start-page: 12 year: 2004 ident: 10.1016/j.ejor.2019.08.020_bib0031 article-title: Outperforming completely randomized designs publication-title: Journal of Quality Technology doi: 10.1080/00224065.2004.11980249 – volume: 155 start-page: 623—648 year: 2007 ident: 10.1016/j.ejor.2019.08.020_bib0056 article-title: The quadratic knapsack problem—a survey publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2006.08.007 |
| SSID | ssj0001515 |
| Score | 2.4334836 |
| Snippet | •We define a novel type of nonseparable multidimensional knapsack problem.•The new knapsack problem arises in the statistical design of mixture experiments.•We... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 201 |
| SubjectTerms | D- and I-optimality Metaheuristics Mixed integer nonlinear programming (MINLP) Nonlinear multidimensional knapsack problem Variable neighborhood search (VNS) algorithm |
| Title | A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments |
| URI | https://dx.doi.org/10.1016/j.ejor.2019.08.020 |
| Volume | 281 |
| WOSCitedRecordID | wos000495480100016&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELaWFiE48FiKKC_5wC1KlDh-5RhQeR2qClq04hI5jiPttmRXu0u18GP4rYxjJ1laqACJSxRZ8a7j-TIej2fmQ-g5JXEZU1OHsKE1IZWKhxJ0YqizktGKxzoxqiWbEIeHcjLJjkaj710uzPmZaBq52WSL_ypqaANh29TZvxB3_6PQAPcgdLiC2OH6R4LPg8aVv1BLFy5Y2QL-rvhGcNqoxUrp08ATyXRhjnPQHJ_teU0b0NEeuk837eHCQAGw-q0X31u00LDsfIu-iFDvbH49d_F8R1Hv0_mq6unaJbqfDK3wRo4OPHjRN35U32D5al3defQ-2vZUwLbU8qbwwX12KYXGpW0JERLiEjgj47SwFCTk0hENdGqaOGqXn_Dola53h7j1m7iM60tLg_NSzCIzm9s6sEnWlm4l8bAQ9uGJH-yg7JjAurVEPuk1tEsEy0Dx7-ZvDybv-rXemoPtOZV_CZ-W5SIIL_7Tr02fLXPm-C667fchOHf4uYdGphmjG10axBjd6eg-sNf-Y3Rrq3blffQpxz3O8EWc4Q5n2OMMTxsMOMMeZ9jhDM9r7HGGt3C2h05eHRy_fBN6oo5Qp5ytQ1FaM5XpVNYstZQHWcVYnVYijquYlrIsJQNVYLjWdVpLoyuw-0tNa0rLMhZ1-gDtwJDNQ4QTxqtMKV4JnVKujaRgGRBqdMKJIgnfR0k3h4X2VewtmcpZ0YUrzgo774Wd98IyrJJ4HwV9n4Wr4XLl06wTTeGtUGddFoCkK_o9-sd-j9HN4WN5gnbWyy_mKbquz9fT1fKZB9wPu_auoQ |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+nonlinear+multidimensional+knapsack+problem+in+the+optimal+design+of+mixture+experiments&rft.jtitle=European+journal+of+operational+research&rft.au=Goos%2C+P.&rft.au=Syafitri%2C+U.&rft.au=Sartono%2C+B.&rft.au=Vazquez%2C+A.R.&rft.date=2020-02-16&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=281&rft.issue=1&rft.spage=201&rft.epage=221&rft_id=info:doi/10.1016%2Fj.ejor.2019.08.020&rft.externalDocID=S0377221719306733 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |