01040nam0 22002771i 450 UON0005323220231205102235.60420020107d1983 |0itac50 bachiCN|||| 1||||Fang Yizhi nianpuRen DaopinHefeiAnhui jiaoyu chubanshe1983297 p.19 cmCINAStoriaUONC001682FICNHefeiUONL001034CIN IV ACINA - STORIA ANTICA FINO GUERRA dell'OPPIO (1839) ESCLUSOAREN DaopinUONV033707651894Anhui Jiaoyu ChubansheUONV252532650ITSOL20240220RICASIBA - SISTEMA BIBLIOTECARIO DI ATENEOUONSIUON00053232SIBA - SISTEMA BIBLIOTECARIO DI ATENEOSI CIN IV A 105 SI SA 41957 5 105 SHANGHAI (CINA) - STORIACINA - StoriaUONC007998Fang Yizhi nianpu1150172UNIOR00938nam0 22002531i 450 UON0019463020231205103229.13952-500-2532-320030730d1995 |0itac50 barusRU|||| ||||| Krusenie p'edestalastrichi k portretv M. S. GorbacevaV. I. BoldinMoskvaRespublika1995. 446 p. ; 21 cm.Russia (Federazione)Storia1990-UONC038507FIRUMoskvaUONL003152BOLDINV. I.UONV115384678483RespublikaUONV265925650ITSOL20250404RICASIBA - SISTEMA BIBLIOTECARIO DI ATENEOUONSIUON00194630SIBA - SISTEMA BIBLIOTECARIO DI ATENEOSI F D 0021 SI SC 29223 5 0021 Krusenie p'edestala1292192UNIOR04928nam 2201453z- 450 991055768600332120210501(CKB)5400000000044672(oapen)https://directory.doabooks.org/handle/20.500.12854/69200(oapen)doab69200(EXLCZ)99540000000004467220202105d2020 |y 0engurmn|---annantxtrdacontentcrdamediacrrdacarrierAdvances and Novel Approaches in Discrete OptimizationBasel, SwitzerlandMDPI - Multidisciplinary Digital Publishing Institute20201 online resource (354 p.)3-03943-222-2 3-03943-223-0 Discrete optimization is an important area of Applied Mathematics with a broad spectrum of applications in many fields. This book results from a Special Issue in the journal Mathematics entitled 'Advances and Novel Approaches in Discrete Optimization'. It contains 17 articles covering a broad spectrum of subjects which have been selected from 43 submitted papers after a thorough refereeing process. Among other topics, it includes seven articles dealing with scheduling problems, e.g., online scheduling, batching, dual and inverse scheduling problems, or uncertain scheduling problems. Other subjects are graphs and applications, evacuation planning, the max-cut problem, capacitated lot-sizing, and packing algorithms.Mathematics & sciencebicsscResearch & information: generalbicsscABC4 indexalgorithmAND/OR treeapproximation algorithmarithmetic meanbalaban indexbatch schedulingbatching schedulingbi-criteria schedulingbin packingbranch and boundcapacitated lot sizingcombinatorial generationcombinatorial optimizationcompetitive ratiocontraflow configurationcrossing numbercyclic permutationdeep learningdegree of vertexdivisible numbersdual problemdue-datedynamic flowdynamic programmingembedded systemsEuler-Catalan's triangleevacuation planningextended adjacency indexforgotten indexFPGAFPTASGA5 indexgenetic algorithmgraphHarris hawks optimizerHDN3(m)inventoryinverse problemirregular 3D objectsjob familiesjob-shopjoin productlabeled Dyck pathlatenesslinear deteriorationLNSload frequency controllogistic supportsmachine non-availabilitymakespanmakespan criterionMax-cut problemmaximum machine costmeta-heuristicsmethodminimization of maximum penaltymixed integer formulationn/anetwork optimizationnonlinear optimizationnumerical conversiononline algorithmoperator non-availabilitypackingpartial lane reversals, algorithms and complexityparticle swarm optimizationpointer networkquasi-phi-function sranking algorithmreclassified the zagreb indicesreinforcement learningrelease-timeretailRHDN3(m)RISCschedulingscheduling algorithmscheduling with rejectionsensitivity analysisshortagessingle-machine schedulingsmart gridsupervised learningTHDN3(m)time complexitytotal weighted completion timeTransportationunary NP-harduncertain processing timesunranking algorithmMathematics & scienceResearch & information: generalWerner Frankedt549614Werner FrankothBOOK9910557686003321Advances and Novel Approaches in Discrete Optimization3025378UNINA