Advances and Novel Approaches in Discrete Optimization 

<br/><br/><br/>English[eng] 
<br/><br/><label>Subjects--Topical Terms: </label><br/>forgotten index||balaban index||reclassified the zagreb indices||ABC4 index||GA5 index||HDN3(m)||THDN3(m)||RHDN3(m)||degree of vertex||extended adjacency index||scheduling with rejection||machine non-availability||operator non-availability||dynamic programming||FPTAS||Transportation||batching scheduling||total weighted completion time||unary NP-hard||approximation algorithm||bi-criteria scheduling||online algorithm||makespan||maximum machine cost||competitive ratio||network optimization||dynamic flow||evacuation planning||contraflow configuration||partial lane reversals, algorithms and complexity||logistic supports||scheduling algorithm||release-time||due-date||divisible numbers||lateness||bin packing||time complexity||batch scheduling||linear deterioration||job families||Max-cut problem||combinatorial optimization||deep learning||pointer network||supervised learning||reinforcement learning||capacitated lot sizing||mixed integer formulation||retail||inventory||shortages||graph||join product||crossing number||cyclic permutation||arithmetic mean||combinatorial generation||method||algorithm||AND/OR tree||Euler–Catalan’s triangle||labeled Dyck path||ranking algorithm||unranking algorithm||Harris hawks optimizer||load frequency control||sensitivity analysis||smart grid||particle swarm optimization||genetic algorithm||meta-heuristics||packing||irregular 3D objects||quasi-phi-function s||nonlinear optimization||single-machine scheduling||minimization of maximum penalty||dual problem||inverse problem||branch and bound||LNS||numerical conversion||RISC||FPGA||embedded systems||scheduling||job-shop||makespan criterion||uncertain processing times||n/a