scientific article
zbMath0516.90023MaRDI QIDQ3664785
A. I. Kuksa, V. S. Mikhalevich
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityschedulingnumerical methodsNP-hardnessbranch and bound methodsequential optimizationapproximate algorithmsoptimal resource allocationnonlinear knapsack problemsequential analysis of variantsLagrangian relaxation techniques
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (17)
This page was built for publication: