Further processing options
online resource

The maximum diversity assortment selection problem

Bibliographic Details
Published in: Mathematical methods of operations research pages:521-554; year:2021; 93(2021), 3 vom: Juni, Seite 521-554; month:06; number:3; volume:93
Authors and Corporations: Prause, Felix (Author), Hoppmann-Baum, Kai (Author), Defourny, Boris (Author), Koch, Thorsten (Author)
Title: The maximum diversity assortment selection problem Felix Prause, Kai Hoppmann-Baum, Boris Defourny, Thorsten Koch
Type of Resource: E-Book Component Part
Language: English
published:
2021
Series: : Mathematical methods of operations research, 93(2021), 3 vom: Juni, Seite 521-554
, volume:93
Subjects:
Source: Verbunddaten SWB
Lizenzfreie Online-Ressourcen
LEADER 02304naa a2200637 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 
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 |||s 
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 
852 |2 lfer  |a DE-Gla1 
852 |2 lfer  |a DE-14 
852 |2 lfer  |a DE-Zwi2 
852 |2 lfer  |a DE-Brt1 
852 |2 lfer  |a DE-Bn3 
852 |2 lfer  |a DE-Ch1 
852 |2 lfer  |a DE-105 
852 |2 lfer  |a DE-D161 
852 |2 lfer  |a DE-Zi4 
852 |2 lfer  |a DE-Pl11 
852 |2 lfer  |a DE-15 
852 |2 lfer  |a DE-Rs1 
852 |2 lfer  |a DE-L229 
980 |a 1764046854  |b 0  |k 1764046854 
openURL url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fwww.ub.uni-leipzig.de%3Agenerator&rft.title=The+maximum+diversity+assortment+selection+problem&rft.date=2021&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.creator=Prause%2C+Felix&rft.pub=&rft.format=ElectronicBookComponentPart&rft.language=English
SOLR
_version_ 1717111165960585216
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
container_reference pages:521-554; year:2021; 93(2021), 3 vom: Juni, Seite 521-554; month:06; number:3; volume:93
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
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 LFER, DE-Gla1, DE-14, DE-Zwi2, DE-Brt1, DE-Bn3, DE-Ch1, DE-105, DE-D161, DE-Zi4, DE-Pl11, DE-15, DE-Rs1, DE-L229
is_hierarchy_id 0-1764046854
is_hierarchy_title The maximum diversity assortment selection problem
isil_str_mv LFER, DE-Gla1, DE-14, DE-Zwi2, DE-Brt1, DE-Bn3, DE-Ch1, DE-105, DE-D161, DE-Zi4, DE-Pl11, DE-15, DE-Rs1, DE-L229
issn 1432-5217
kxp_id_str 1764046854
language English
last_indexed 2021-11-22T07:06:56.773Z
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 prause:2021:themaximumdiversityassortmentselectionproblem:
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_id 1764046854
recordtype marcfinc
rvk_facet No subject assigned
score 17,163353
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, 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 |||s, 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, lfer DE-Gla1, lfer DE-14, lfer DE-Zwi2, lfer DE-Brt1, lfer DE-Bn3, lfer DE-Ch1, lfer DE-105, lfer DE-D161, lfer DE-Zi4, lfer DE-Pl11, lfer DE-15, lfer DE-Rs1, lfer DE-L229
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
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_list_str The maximum diversity assortment selection problem
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
topic_facet Combinatorial optimization, Mixed integer programming, Two-dimensional knapsack problem, Maximum diversity problem
url https://link.springer.com/content/pdf/10.1007/s00186-021-00740-2.pdf, https://doi.org/10.1007/s00186-021-00740-2