Eintrag weiter verarbeiten
The maximum diversity assortment selection problem
Gespeichert in:
| Veröffentlicht in: | Mathematical methods of operations research 93(2021), 3 vom: Juni, Seite 521-554 |
|---|---|
| Personen und Körperschaften: | , , , |
| Titel: | The maximum diversity assortment selection problem/ Felix Prause, Kai Hoppmann-Baum, Boris Defourny, Thorsten Koch |
| Format: | E-Book-Kapitel |
| Sprache: | Englisch |
| veröffentlicht: |
2021
|
| Gesamtaufnahme: |
: Mathematical methods of operations research, 93(2021), 3 vom: Juni, Seite 521-554
, volume:93 |
| Schlagwörter: | |
| Quelle: | Verbunddaten SWB Lizenzfreie Online-Ressourcen |
| LEADER | 01976naa a2200493 4500 | ||
|---|---|---|---|
| 001 | 0-1764046854 | ||
| 003 | DE-627 | ||
| 005 | 20210721113839.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 210721s2021 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00186-021-00740-2 |2 doi | |
| 035 | |a (DE-627)1764046854 | ||
| 035 | |a (DE-599)KXP1764046854 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rda | ||
| 041 | |a eng | ||
| 100 | 1 | |a Prause, Felix |e VerfasserIn |4 aut | |
| 245 | 1 | 4 | |a The maximum diversity assortment selection problem |c Felix Prause, Kai Hoppmann-Baum, Boris Defourny, Thorsten Koch |
| 264 | 1 | |c 2021 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 650 | 4 | |a Combinatorial optimization | |
| 650 | 4 | |a Mixed integer programming | |
| 650 | 4 | |a Two-dimensional knapsack problem | |
| 650 | 4 | |a Maximum diversity problem | |
| 655 | 4 | |a Aufsatz in Zeitschrift |5 DE-206 | |
| 700 | 1 | |a Hoppmann-Baum, Kai |e VerfasserIn |4 aut | |
| 700 | 1 | |a Defourny, Boris |e VerfasserIn |4 aut | |
| 700 | 1 | |a Koch, Thorsten |e VerfasserIn |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Mathematical methods of operations research |d Berlin : Springer, 1956 |g 93(2021), 3 vom: Juni, Seite 521-554 |h Online-Ressource |w (DE-627)253770734 |w (DE-600)1459420-1 |w (DE-576)072578718 |x 1432-5217 |7 nnns |
| 773 | 1 | 8 | |g volume:93 |g year:2021 |g number:3 |g month:06 |g pages:521-554 |
| 856 | 4 | 0 | |u https://link.springer.com/content/pdf/10.1007/s00186-021-00740-2.pdf |x Verlag |z kostenfrei |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00186-021-00740-2 |x Resolving-System |z kostenfrei |
| 936 | u | w | |d 93 |j 2021 |e 3 |c 6 |h 521-554 |
| 951 | |a AR | ||
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00186-021-00740-2 |9 LFER |
| 856 | 4 | 0 | |u https://link.springer.com/content/pdf/10.1007/s00186-021-00740-2.pdf |9 LFER |
| 852 | |a LFER |z 2021-08-11T04:45:37Z | ||
| 970 | |c OD | ||
| 971 | |c EBOOK | ||
| 972 | |c EBOOK | ||
| 973 | |c Aufsatz | ||
| 935 | |a lfer | ||
| 980 | |a 1764046854 |b 0 |k 1764046854 |c lfer | ||
| openURL |
url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=The+maximum+diversity+assortment+selection+problem&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.creator=Prause%2C+Felix&rft.pub=&rft.format=Journal&rft.language=English&rft.issn=1432-5217 |
|---|
| _version_ | 1757971871577407488 |
|---|---|
| access_facet | Electronic Resources |
| author | Prause, Felix, Hoppmann-Baum, Kai, Defourny, Boris, Koch, Thorsten |
| author_facet | Prause, Felix, Hoppmann-Baum, Kai, Defourny, Boris, Koch, Thorsten |
| author_role | aut, aut, aut, aut |
| author_sort | Prause, Felix |
| author_variant | f p fp, k h b khb, b d bd, t k tk |
| callnumber-sort | |
| collection | lfer |
| container_reference | 93(2021), 3 vom: Juni, Seite 521-554 |
| container_title | Mathematical methods of operations research |
| ctrlnum | (DE-627)1764046854, (DE-599)KXP1764046854 |
| doi_str_mv | 10.1007/s00186-021-00740-2 |
| facet_avail | Online, Free |
| finc_class_facet | not assigned |
| format | ElectronicBookComponentPart |
| format_access_txtF_mv | Article, E-Article |
| format_de105 | Ebook |
| format_de14 | Article, E-Article |
| format_de15 | Article, E-Article |
| format_del152 | Buch |
| format_detail_txtF_mv | text-online-monograph-child |
| format_dezi4 | e-Book |
| format_finc | Article, E-Article |
| format_legacy | ElectronicBookPart |
| format_strict_txtF_mv | E-Article |
| genre | Aufsatz in Zeitschrift DE-206 |
| genre_facet | Aufsatz in Zeitschrift |
| geogr_code | not assigned |
| geogr_code_person | not assigned |
| hierarchy_parent_id | 0-253770734 |
| hierarchy_parent_title | Mathematical methods of operations research |
| hierarchy_sequence | 93(2021), 3 vom: Juni, Seite 521-554 |
| hierarchy_top_id | 0-253770734 |
| hierarchy_top_title | Mathematical methods of operations research |
| id | 0-1764046854 |
| illustrated | Not Illustrated |
| imprint | 2021 |
| imprint_str_mv | 2021 |
| institution | DE-D117, DE-105, LFER, DE-Ch1, DE-15, DE-14, DE-Zwi2 |
| is_hierarchy_id | 0-1764046854 |
| is_hierarchy_title | The maximum diversity assortment selection problem |
| isil_str_mv | LFER |
| issn | 1432-5217 |
| kxp_id_str | 1764046854 |
| language | English |
| last_indexed | 2023-02-16T07:30:21.508Z |
| local_heading_facet_dezwi2 | Combinatorial optimization, Mixed integer programming, Two-dimensional knapsack problem, Maximum diversity problem |
| marc024a_ct_mv | 10.1007/s00186-021-00740-2 |
| match_str | prause2021themaximumdiversityassortmentselectionproblem |
| mega_collection | Verbunddaten SWB, Lizenzfreie Online-Ressourcen |
| misc_de105 | EBOOK |
| multipart_link | 072578718 |
| multipart_part | (072578718)93(2021), 3 vom: Juni, Seite 521-554 |
| publishDate | 2021 |
| publishDateSort | 2021 |
| publishPlace | |
| publisher | |
| record_format | marcfinc |
| record_id | 1764046854 |
| recordtype | marcfinc |
| rvk_facet | No subject assigned |
| source_id | 0 |
| spelling | Prause, Felix VerfasserIn aut, The maximum diversity assortment selection problem Felix Prause, Kai Hoppmann-Baum, Boris Defourny, Thorsten Koch, 2021, Text txt rdacontent, Computermedien c rdamedia, Online-Ressource cr rdacarrier, Combinatorial optimization, Mixed integer programming, Two-dimensional knapsack problem, Maximum diversity problem, Aufsatz in Zeitschrift DE-206, Hoppmann-Baum, Kai VerfasserIn aut, Defourny, Boris VerfasserIn aut, Koch, Thorsten VerfasserIn aut, Enthalten in Mathematical methods of operations research Berlin : Springer, 1956 93(2021), 3 vom: Juni, Seite 521-554 Online-Ressource (DE-627)253770734 (DE-600)1459420-1 (DE-576)072578718 1432-5217 nnns, volume:93 year:2021 number:3 month:06 pages:521-554, https://link.springer.com/content/pdf/10.1007/s00186-021-00740-2.pdf Verlag kostenfrei, https://doi.org/10.1007/s00186-021-00740-2 Resolving-System kostenfrei, https://doi.org/10.1007/s00186-021-00740-2 LFER, https://link.springer.com/content/pdf/10.1007/s00186-021-00740-2.pdf LFER, LFER 2021-08-11T04:45:37Z |
| spellingShingle | Prause, Felix, Hoppmann-Baum, Kai, Defourny, Boris, Koch, Thorsten, The maximum diversity assortment selection problem, Combinatorial optimization, Mixed integer programming, Two-dimensional knapsack problem, Maximum diversity problem, Aufsatz in Zeitschrift |
| title | The maximum diversity assortment selection problem |
| title_auth | The maximum diversity assortment selection problem |
| title_full | The maximum diversity assortment selection problem Felix Prause, Kai Hoppmann-Baum, Boris Defourny, Thorsten Koch |
| title_fullStr | The maximum diversity assortment selection problem Felix Prause, Kai Hoppmann-Baum, Boris Defourny, Thorsten Koch |
| title_full_unstemmed | The maximum diversity assortment selection problem Felix Prause, Kai Hoppmann-Baum, Boris Defourny, Thorsten Koch |
| title_in_hierarchy | The maximum diversity assortment selection problem / Felix Prause, Kai Hoppmann-Baum, Boris Defourny, Thorsten Koch, |
| title_short | The maximum diversity assortment selection problem |
| title_sort | maximum diversity assortment selection problem |
| topic | Combinatorial optimization, Mixed integer programming, Two-dimensional knapsack problem, Maximum diversity problem, Aufsatz in Zeitschrift |
| topic_facet | Combinatorial optimization, Mixed integer programming, Two-dimensional knapsack problem, Maximum diversity problem, Aufsatz in Zeitschrift |
| url | https://link.springer.com/content/pdf/10.1007/s00186-021-00740-2.pdf, https://doi.org/10.1007/s00186-021-00740-2 |