Two heuristics for the capacitated minimum spanning tree problem with time windows

Gespeichert in:

Autor*in:	Kritikos, Manolis N. [verfasserIn] Ioannou, George [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2019

Übergeordnetes Werk:	Enthalten in: Journal of the Operational Research Society - Operational Research Society, London : Taylor and Francis, 1978, 70(2019), 4, Seite 555-567
Übergeordnetes Werk:	volume:70 ; year:2019 ; number:4 ; pages:555-567

Links:	Link aufrufen Link aufrufen

DOI / URN:	10.1080/01605682.2018.1447255

Katalog-ID:	1697821154

Internformat


LEADER	01000caa a2200265 4500
001	1697821154
003	DE-627
005	20240124091145.0
007	cr uuu---uuuuu
008	200511s2019 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1080/01605682.2018.1447255 \|2 doi
035			\|a (DE-627)1697821154
035			\|a (DE-599)KXP1697821154
040			\|a DE-627 \|b ger \|c DE-627 \|e rda
041			\|a eng
100	1		\|a Kritikos, Manolis N. \|e verfasserin \|4 aut
245	1	0	\|a Two heuristics for the capacitated minimum spanning tree problem with time windows \|c Manolis N. Kritikos & George Ioannou
264		1	\|c 2019
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
700	1		\|a Ioannou, George \|e verfasserin \|0 (DE-588)1317028368 \|0 (DE-627)1878841815 \|4 aut
773	0	8	\|i Enthalten in \|a Operational Research Society \|t Journal of the Operational Research Society \|d London : Taylor and Francis, 1978 \|g 70(2019), 4, Seite 555-567 \|h Online-Ressource \|w (DE-627)320465098 \|w (DE-600)2007775-0 \|w (DE-576)103939180 \|x 1476-9360 \|7 nnns
773	1	8	\|g volume:70 \|g year:2019 \|g number:4 \|g pages:555-567
856	4	0	\|u https://www.tandfonline.com/doi/pdf/10.1080/01605682.2018.1447255?needAccess=true \|x Verlag \|z lizenzpflichtig
856	4	0	\|u https://doi.org/10.1080/01605682.2018.1447255 \|x Resolving-System \|z lizenzpflichtig
912			\|a GBV_USEFLAG_U
912			\|a GBV_ILN_26
912			\|a ISIL_DE-206
912			\|a SYSFLAG_1
912			\|a GBV_KXP
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_31
912			\|a GBV_ILN_63
912			\|a GBV_ILN_70
912			\|a GBV_ILN_100
912			\|a GBV_ILN_224
912			\|a GBV_ILN_285
912			\|a GBV_ILN_370
912			\|a GBV_ILN_374
912			\|a GBV_ILN_647
912			\|a GBV_ILN_702
912			\|a GBV_ILN_2001
912			\|a GBV_ILN_2003
912			\|a GBV_ILN_2005
912			\|a GBV_ILN_2006
912			\|a GBV_ILN_2007
912			\|a GBV_ILN_2008
912			\|a GBV_ILN_2009
912			\|a GBV_ILN_2010
912			\|a GBV_ILN_2011
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_2015
912			\|a GBV_ILN_2018
912			\|a GBV_ILN_2020
912			\|a GBV_ILN_2021
912			\|a GBV_ILN_2026
912			\|a GBV_ILN_2027
912			\|a GBV_ILN_2034
912			\|a GBV_ILN_2044
912			\|a GBV_ILN_2050
912			\|a GBV_ILN_2056
912			\|a GBV_ILN_2057
912			\|a GBV_ILN_2061
912			\|a GBV_ILN_2088
912			\|a GBV_ILN_2093
912			\|a GBV_ILN_2107
912			\|a GBV_ILN_2111
912			\|a GBV_ILN_2129
912			\|a GBV_ILN_2190
912			\|a GBV_ILN_2336
912			\|a GBV_ILN_2507
912			\|a GBV_ILN_2548
912			\|a GBV_ILN_2935
912			\|a GBV_ILN_2940
912			\|a GBV_ILN_2949
912			\|a GBV_ILN_2950
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4035
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4046
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4242
912			\|a GBV_ILN_4251
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4346
912			\|a GBV_ILN_4393
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 70 \|j 2019 \|e 4 \|h 555-567
980			\|2 26 \|1 01 \|x 0206 \|b 3664432371 \|y x1z \|z 11-05-20
982			\|2 26 \|1 00 \|x DE-206 \|8 56 \|a Spanning tree
982			\|2 26 \|1 00 \|x DE-206 \|8 56 \|a heuristics
982			\|2 26 \|1 00 \|x DE-206 \|8 56 \|a time windows

Indexfelder

author_variant	m n k mn mnk g i gi
matchkey_str	article:14769360:2019----::whuitcfrhcpcttdiiusanntep
hierarchy_sort_str	2019
publishDate	2019
allfields	10.1080/01605682.2018.1447255 doi (DE-627)1697821154 (DE-599)KXP1697821154 DE-627 ger DE-627 rda eng Kritikos, Manolis N. verfasserin aut Two heuristics for the capacitated minimum spanning tree problem with time windows Manolis N. Kritikos & George Ioannou 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Ioannou, George verfasserin (DE-588)1317028368 (DE-627)1878841815 aut Enthalten in Operational Research Society Journal of the Operational Research Society London : Taylor and Francis, 1978 70(2019), 4, Seite 555-567 Online-Ressource (DE-627)320465098 (DE-600)2007775-0 (DE-576)103939180 1476-9360 nnns volume:70 year:2019 number:4 pages:555-567 https://www.tandfonline.com/doi/pdf/10.1080/01605682.2018.1447255?needAccess=true Verlag lizenzpflichtig https://doi.org/10.1080/01605682.2018.1447255 Resolving-System lizenzpflichtig GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_31 GBV_ILN_63 GBV_ILN_70 GBV_ILN_100 GBV_ILN_224 GBV_ILN_285 GBV_ILN_370 GBV_ILN_374 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2061 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2107 GBV_ILN_2111 GBV_ILN_2129 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2548 GBV_ILN_2935 GBV_ILN_2940 GBV_ILN_2949 GBV_ILN_2950 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4346 GBV_ILN_4393 GBV_ILN_4700 AR 70 2019 4 555-567 26 01 0206 3664432371 x1z 11-05-20 26 00 DE-206 56 Spanning tree 26 00 DE-206 56 heuristics 26 00 DE-206 56 time windows
spelling	10.1080/01605682.2018.1447255 doi (DE-627)1697821154 (DE-599)KXP1697821154 DE-627 ger DE-627 rda eng Kritikos, Manolis N. verfasserin aut Two heuristics for the capacitated minimum spanning tree problem with time windows Manolis N. Kritikos & George Ioannou 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Ioannou, George verfasserin (DE-588)1317028368 (DE-627)1878841815 aut Enthalten in Operational Research Society Journal of the Operational Research Society London : Taylor and Francis, 1978 70(2019), 4, Seite 555-567 Online-Ressource (DE-627)320465098 (DE-600)2007775-0 (DE-576)103939180 1476-9360 nnns volume:70 year:2019 number:4 pages:555-567 https://www.tandfonline.com/doi/pdf/10.1080/01605682.2018.1447255?needAccess=true Verlag lizenzpflichtig https://doi.org/10.1080/01605682.2018.1447255 Resolving-System lizenzpflichtig GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_31 GBV_ILN_63 GBV_ILN_70 GBV_ILN_100 GBV_ILN_224 GBV_ILN_285 GBV_ILN_370 GBV_ILN_374 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2061 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2107 GBV_ILN_2111 GBV_ILN_2129 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2548 GBV_ILN_2935 GBV_ILN_2940 GBV_ILN_2949 GBV_ILN_2950 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4346 GBV_ILN_4393 GBV_ILN_4700 AR 70 2019 4 555-567 26 01 0206 3664432371 x1z 11-05-20 26 00 DE-206 56 Spanning tree 26 00 DE-206 56 heuristics 26 00 DE-206 56 time windows
allfields_unstemmed	10.1080/01605682.2018.1447255 doi (DE-627)1697821154 (DE-599)KXP1697821154 DE-627 ger DE-627 rda eng Kritikos, Manolis N. verfasserin aut Two heuristics for the capacitated minimum spanning tree problem with time windows Manolis N. Kritikos & George Ioannou 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Ioannou, George verfasserin (DE-588)1317028368 (DE-627)1878841815 aut Enthalten in Operational Research Society Journal of the Operational Research Society London : Taylor and Francis, 1978 70(2019), 4, Seite 555-567 Online-Ressource (DE-627)320465098 (DE-600)2007775-0 (DE-576)103939180 1476-9360 nnns volume:70 year:2019 number:4 pages:555-567 https://www.tandfonline.com/doi/pdf/10.1080/01605682.2018.1447255?needAccess=true Verlag lizenzpflichtig https://doi.org/10.1080/01605682.2018.1447255 Resolving-System lizenzpflichtig GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_31 GBV_ILN_63 GBV_ILN_70 GBV_ILN_100 GBV_ILN_224 GBV_ILN_285 GBV_ILN_370 GBV_ILN_374 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2061 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2107 GBV_ILN_2111 GBV_ILN_2129 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2548 GBV_ILN_2935 GBV_ILN_2940 GBV_ILN_2949 GBV_ILN_2950 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4346 GBV_ILN_4393 GBV_ILN_4700 AR 70 2019 4 555-567 26 01 0206 3664432371 x1z 11-05-20 26 00 DE-206 56 Spanning tree 26 00 DE-206 56 heuristics 26 00 DE-206 56 time windows
allfieldsGer	10.1080/01605682.2018.1447255 doi (DE-627)1697821154 (DE-599)KXP1697821154 DE-627 ger DE-627 rda eng Kritikos, Manolis N. verfasserin aut Two heuristics for the capacitated minimum spanning tree problem with time windows Manolis N. Kritikos & George Ioannou 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Ioannou, George verfasserin (DE-588)1317028368 (DE-627)1878841815 aut Enthalten in Operational Research Society Journal of the Operational Research Society London : Taylor and Francis, 1978 70(2019), 4, Seite 555-567 Online-Ressource (DE-627)320465098 (DE-600)2007775-0 (DE-576)103939180 1476-9360 nnns volume:70 year:2019 number:4 pages:555-567 https://www.tandfonline.com/doi/pdf/10.1080/01605682.2018.1447255?needAccess=true Verlag lizenzpflichtig https://doi.org/10.1080/01605682.2018.1447255 Resolving-System lizenzpflichtig GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_31 GBV_ILN_63 GBV_ILN_70 GBV_ILN_100 GBV_ILN_224 GBV_ILN_285 GBV_ILN_370 GBV_ILN_374 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2061 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2107 GBV_ILN_2111 GBV_ILN_2129 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2548 GBV_ILN_2935 GBV_ILN_2940 GBV_ILN_2949 GBV_ILN_2950 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4346 GBV_ILN_4393 GBV_ILN_4700 AR 70 2019 4 555-567 26 01 0206 3664432371 x1z 11-05-20 26 00 DE-206 56 Spanning tree 26 00 DE-206 56 heuristics 26 00 DE-206 56 time windows
allfieldsSound	10.1080/01605682.2018.1447255 doi (DE-627)1697821154 (DE-599)KXP1697821154 DE-627 ger DE-627 rda eng Kritikos, Manolis N. verfasserin aut Two heuristics for the capacitated minimum spanning tree problem with time windows Manolis N. Kritikos & George Ioannou 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Ioannou, George verfasserin (DE-588)1317028368 (DE-627)1878841815 aut Enthalten in Operational Research Society Journal of the Operational Research Society London : Taylor and Francis, 1978 70(2019), 4, Seite 555-567 Online-Ressource (DE-627)320465098 (DE-600)2007775-0 (DE-576)103939180 1476-9360 nnns volume:70 year:2019 number:4 pages:555-567 https://www.tandfonline.com/doi/pdf/10.1080/01605682.2018.1447255?needAccess=true Verlag lizenzpflichtig https://doi.org/10.1080/01605682.2018.1447255 Resolving-System lizenzpflichtig GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_31 GBV_ILN_63 GBV_ILN_70 GBV_ILN_100 GBV_ILN_224 GBV_ILN_285 GBV_ILN_370 GBV_ILN_374 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2061 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2107 GBV_ILN_2111 GBV_ILN_2129 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2548 GBV_ILN_2935 GBV_ILN_2940 GBV_ILN_2949 GBV_ILN_2950 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4346 GBV_ILN_4393 GBV_ILN_4700 AR 70 2019 4 555-567 26 01 0206 3664432371 x1z 11-05-20 26 00 DE-206 56 Spanning tree 26 00 DE-206 56 heuristics 26 00 DE-206 56 time windows
language	English
source	Enthalten in Journal of the Operational Research Society 70(2019), 4, Seite 555-567 volume:70 year:2019 number:4 pages:555-567
sourceStr	Enthalten in Journal of the Operational Research Society 70(2019), 4, Seite 555-567 volume:70 year:2019 number:4 pages:555-567
format_phy_str_mv	Article
building	26:1
institution	findex.gbv.de
selectbib_iln_str_mv	26@1z
sw_local_iln_str_mv	26:Spanning tree DE-206:Spanning tree 26:heuristics DE-206:heuristics 26:time windows DE-206:time windows
isfreeaccess_bool	false
container_title	Journal of the Operational Research Society
authorswithroles_txt_mv	Kritikos, Manolis N. @@aut@@ Ioannou, George @@aut@@
publishDateDaySort_date	2019-01-01T00:00:00Z
hierarchy_top_id	320465098
id	1697821154
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">1697821154</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240124091145.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">200511s2019 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/01605682.2018.1447255</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)1697821154</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KXP1697821154</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kritikos, Manolis N.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Two heuristics for the capacitated minimum spanning tree problem with time windows</subfield><subfield code="c">Manolis N. Kritikos & George Ioannou</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ioannou, George</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1317028368</subfield><subfield code="0">(DE-627)1878841815</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="a">Operational Research Society</subfield><subfield code="t">Journal of the Operational Research Society</subfield><subfield code="d">London : Taylor and Francis, 1978</subfield><subfield code="g">70(2019), 4, Seite 555-567</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)320465098</subfield><subfield code="w">(DE-600)2007775-0</subfield><subfield code="w">(DE-576)103939180</subfield><subfield code="x">1476-9360</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:70</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:4</subfield><subfield code="g">pages:555-567</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.tandfonline.com/doi/pdf/10.1080/01605682.2018.1447255?needAccess=true</subfield><subfield code="x">Verlag</subfield><subfield code="z">lizenzpflichtig</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1080/01605682.2018.1447255</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">lizenzpflichtig</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_1</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_KXP</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_374</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_647</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2093</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2107</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2548</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2935</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2940</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2949</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2950</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4346</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">70</subfield><subfield code="j">2019</subfield><subfield code="e">4</subfield><subfield code="h">555-567</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">01</subfield><subfield code="x">0206</subfield><subfield code="b">3664432371</subfield><subfield code="y">x1z</subfield><subfield code="z">11-05-20</subfield></datafield><datafield tag="982" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">00</subfield><subfield code="x">DE-206</subfield><subfield code="8">56</subfield><subfield code="a">Spanning tree</subfield></datafield><datafield tag="982" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">00</subfield><subfield code="x">DE-206</subfield><subfield code="8">56</subfield><subfield code="a">heuristics</subfield></datafield><datafield tag="982" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">00</subfield><subfield code="x">DE-206</subfield><subfield code="8">56</subfield><subfield code="a">time windows</subfield></datafield></record></collection>
author	Kritikos, Manolis N.
spellingShingle	Kritikos, Manolis N. 26 Spanning tree 26 heuristics 26 time windows Two heuristics for the capacitated minimum spanning tree problem with time windows
authorStr	Kritikos, Manolis N.
ppnlink_with_tag_str_mv	@@773@@(DE-627)320465098
format	electronic Article
delete_txt_mv	keep
author_role	aut aut
typewithnormlink_str_mv	DifferentiatedPerson@(DE-588)1317028368 Person@(DE-588)1317028368
collection	KXP GVK SWB
remote_str	true
last_changed_iln_str_mv	26@11-05-20
illustrated	Not Illustrated
issn	1476-9360
topic_title	26 00 DE-206 56 Spanning tree 26 00 DE-206 56 heuristics 26 00 DE-206 56 time windows Two heuristics for the capacitated minimum spanning tree problem with time windows Manolis N. Kritikos & George Ioannou
topic	26 Spanning tree 26 heuristics 26 time windows
topic_unstemmed	26 Spanning tree 26 heuristics 26 time windows
topic_browse	26 Spanning tree 26 heuristics 26 time windows
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Journal of the Operational Research Society
normlinkwithtype_str_mv	(DE-588)1317028368@DifferentiatedPerson (DE-588)1317028368@Person
hierarchy_parent_id	320465098
hierarchy_top_title	Journal of the Operational Research Society
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)320465098 (DE-600)2007775-0 (DE-576)103939180
normlinkwithrole_str_mv	(DE-588)1317028368@@aut@@
title	Two heuristics for the capacitated minimum spanning tree problem with time windows
ctrlnum	(DE-627)1697821154 (DE-599)KXP1697821154
title_full	Two heuristics for the capacitated minimum spanning tree problem with time windows Manolis N. Kritikos & George Ioannou
author_sort	Kritikos, Manolis N.
journal	Journal of the Operational Research Society
journalStr	Journal of the Operational Research Society
lang_code	eng
isOA_bool	false
recordtype	marc
publishDateSort	2019
contenttype_str_mv	txt
container_start_page	555
author_browse	Kritikos, Manolis N. Ioannou, George
selectkey	26:x
container_volume	70
format_se	Elektronische Aufsätze
author-letter	Kritikos, Manolis N.
doi_str_mv	10.1080/01605682.2018.1447255
normlink	1317028368 1878841815
normlink_prefix_str_mv	(DE-588)1317028368 (DE-627)1878841815
author2-role	verfasserin
title_sort	two heuristics for the capacitated minimum spanning tree problem with time windows
title_auth	Two heuristics for the capacitated minimum spanning tree problem with time windows
collection_details	GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_31 GBV_ILN_63 GBV_ILN_70 GBV_ILN_100 GBV_ILN_224 GBV_ILN_285 GBV_ILN_370 GBV_ILN_374 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2061 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2107 GBV_ILN_2111 GBV_ILN_2129 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2548 GBV_ILN_2935 GBV_ILN_2940 GBV_ILN_2949 GBV_ILN_2950 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4346 GBV_ILN_4393 GBV_ILN_4700
container_issue	4
title_short	Two heuristics for the capacitated minimum spanning tree problem with time windows
url	https://www.tandfonline.com/doi/pdf/10.1080/01605682.2018.1447255?needAccess=true https://doi.org/10.1080/01605682.2018.1447255
ausleihindikator_str_mv	26
rolewithnormlink_str_mv	@@aut@@(DE-588)1317028368
remote_bool	true
author2	Ioannou, George
author2Str	Ioannou, George
ppnlink	320465098
GND_str_mv	Ioannou, George D. Ioannou, Georgios Ioannou, George
GND_txt_mv	Ioannou, George D. Ioannou, Georgios Ioannou, George
GND_txtF_mv	Ioannou, George D. Ioannou, Georgios Ioannou, George
mediatype_str_mv	c
isOA_txt	false
hochschulschrift_bool	false
doi_str	10.1080/01605682.2018.1447255
up_date	2024-07-04T18:20:20.546Z
_version_	1803673634653339648
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">1697821154</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240124091145.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">200511s2019 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/01605682.2018.1447255</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)1697821154</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KXP1697821154</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kritikos, Manolis N.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Two heuristics for the capacitated minimum spanning tree problem with time windows</subfield><subfield code="c">Manolis N. Kritikos & George Ioannou</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ioannou, George</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1317028368</subfield><subfield code="0">(DE-627)1878841815</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="a">Operational Research Society</subfield><subfield code="t">Journal of the Operational Research Society</subfield><subfield code="d">London : Taylor and Francis, 1978</subfield><subfield code="g">70(2019), 4, Seite 555-567</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)320465098</subfield><subfield code="w">(DE-600)2007775-0</subfield><subfield code="w">(DE-576)103939180</subfield><subfield code="x">1476-9360</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:70</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:4</subfield><subfield code="g">pages:555-567</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.tandfonline.com/doi/pdf/10.1080/01605682.2018.1447255?needAccess=true</subfield><subfield code="x">Verlag</subfield><subfield code="z">lizenzpflichtig</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1080/01605682.2018.1447255</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">lizenzpflichtig</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_1</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_KXP</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_374</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_647</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2093</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2107</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2548</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2935</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2940</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2949</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2950</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4346</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">70</subfield><subfield code="j">2019</subfield><subfield code="e">4</subfield><subfield code="h">555-567</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">01</subfield><subfield code="x">0206</subfield><subfield code="b">3664432371</subfield><subfield code="y">x1z</subfield><subfield code="z">11-05-20</subfield></datafield><datafield tag="982" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">00</subfield><subfield code="x">DE-206</subfield><subfield code="8">56</subfield><subfield code="a">Spanning tree</subfield></datafield><datafield tag="982" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">00</subfield><subfield code="x">DE-206</subfield><subfield code="8">56</subfield><subfield code="a">heuristics</subfield></datafield><datafield tag="982" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">00</subfield><subfield code="x">DE-206</subfield><subfield code="8">56</subfield><subfield code="a">time windows</subfield></datafield></record></collection>
score	7.4000444

Nicht das Richtige dabei?

Schreiben Sie uns!

Two heuristics for the capacitated minimum spanning tree problem with time windows

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?