LEADER 01706nam  2200517   450 
001 9910796226403321
005 20230807215055.0
010   $a91-7519-072-9
035   $a(CKB)3790000000057983
035   $a(SSID)ssj0001559830
035   $a(PQKBManifestationID)16191056
035   $a(PQKBTitleCode)TC0001559830
035   $a(PQKBWorkID)14824402
035   $a(PQKB)11065153
035   $a(MiAaPQ)EBC3328199
035   $a(Au-PeEL)EBL3328199
035   $a(CaPaEBR)ebr11052352
035   $a(OCoLC)927227865
035   $a(EXLCZ)993790000000057983
100   $a20150518h20152015  uy             0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt
182   $cc
183   $acr
200 10$aOn some combinatorial optimization problems $ealgorithms and complexity /$fHannes Uppman
210  1$aLinko?ping, Sweden :$cLinko?ping University Institute Technology,$d2015.
210  4$dİ2015
215   $a1 online resource (53 pages)
225 1 $aLinko?ping Studies in Science and Technology. Dissertations ;$vNumber 1663
300   $aBibliographic Level Mode of Issuance: Monograph
320   $aIncludes bibliographical references and index.
410  0$aLinko?ping studies in science and technology.$pDissertations ;$vNumber 1663.
606   $aCombinatorial optimization
606   $aAssembly-line methods
615  0$aCombinatorial optimization.
615  0$aAssembly-line methods.
676   $a519.3
700   $aUppman$b Hannes$01538495
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910796226403321
996   $aOn some combinatorial optimization problems$93788554
997   $aUNINA