LEADER 04895nam 2201429z- 450 001 9910557686003321 005 20231214133701.0 035 $a(CKB)5400000000044672 035 $a(oapen)https://directory.doabooks.org/handle/20.500.12854/69200 035 $a(EXLCZ)995400000000044672 100 $a20202105d2020 |y 0 101 0 $aeng 135 $aurmn|---annan 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAdvances and Novel Approaches in Discrete Optimization 210 $aBasel, Switzerland$cMDPI - Multidisciplinary Digital Publishing Institute$d2020 215 $a1 electronic resource (354 p.) 311 $a3-03943-222-2 311 $a3-03943-223-0 330 $aDiscrete 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. 606 $aResearch & information: general$2bicssc 606 $aMathematics & science$2bicssc 610 $aforgotten index 610 $abalaban index 610 $areclassified the zagreb indices 610 $aABC4 index 610 $aGA5 index 610 $aHDN3(m) 610 $aTHDN3(m) 610 $aRHDN3(m) 610 $adegree of vertex 610 $aextended adjacency index 610 $ascheduling with rejection 610 $amachine non-availability 610 $aoperator non-availability 610 $adynamic programming 610 $aFPTAS 610 $aTransportation 610 $abatching scheduling 610 $atotal weighted completion time 610 $aunary NP-hard 610 $aapproximation algorithm 610 $abi-criteria scheduling 610 $aonline algorithm 610 $amakespan 610 $amaximum machine cost 610 $acompetitive ratio 610 $anetwork optimization 610 $adynamic flow 610 $aevacuation planning 610 $acontraflow configuration 610 $apartial lane reversals, algorithms and complexity 610 $alogistic supports 610 $ascheduling algorithm 610 $arelease-time 610 $adue-date 610 $adivisible numbers 610 $alateness 610 $abin packing 610 $atime complexity 610 $abatch scheduling 610 $alinear deterioration 610 $ajob families 610 $aMax-cut problem 610 $acombinatorial optimization 610 $adeep learning 610 $apointer network 610 $asupervised learning 610 $areinforcement learning 610 $acapacitated lot sizing 610 $amixed integer formulation 610 $aretail 610 $ainventory 610 $ashortages 610 $agraph 610 $ajoin product 610 $acrossing number 610 $acyclic permutation 610 $aarithmetic mean 610 $acombinatorial generation 610 $amethod 610 $aalgorithm 610 $aAND/OR tree 610 $aEuler-Catalan's triangle 610 $alabeled Dyck path 610 $aranking algorithm 610 $aunranking algorithm 610 $aHarris hawks optimizer 610 $aload frequency control 610 $asensitivity analysis 610 $asmart grid 610 $aparticle swarm optimization 610 $agenetic algorithm 610 $ameta-heuristics 610 $apacking 610 $airregular 3D objects 610 $aquasi-phi-function s 610 $anonlinear optimization 610 $asingle-machine scheduling 610 $aminimization of maximum penalty 610 $adual problem 610 $ainverse problem 610 $abranch and bound 610 $aLNS 610 $anumerical conversion 610 $aRISC 610 $aFPGA 610 $aembedded systems 610 $ascheduling 610 $ajob-shop 610 $amakespan criterion 610 $auncertain processing times 615 7$aResearch & information: general 615 7$aMathematics & science 700 $aWerner$b Frank$4edt$0549614 702 $aWerner$b Frank$4oth 906 $aBOOK 912 $a9910557686003321 996 $aAdvances and Novel Approaches in Discrete Optimization$93025378 997 $aUNINA