scientific article
From MaRDI portal
Publication:3935744
zbMath0478.49001MaRDI QIDQ3935744
Michail Michailowitsch Kowaljow, Eberhard Girlich
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
decision makingglobal optimalitydiscrete optimizationoptimal standardizationGreedy-algorithms for maximum problems of convex functions on discrete latticeslinearization of combinatorical optimization problems
Applications of mathematical programming (90C90) Methods of successive quadratic programming type (90C55) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02)
Related Items
A simple but NP-hard problem of mixed-discrete programming and its solution by approximate algorithms ⋮ Problems of discrete optimization: challenges and main approaches to solve them ⋮ On the stabilization of resource usage for cyclical sequencing problems ⋮ On the effectivity of gradient methods for cutting stock problems ⋮ A short proof of optimality of the bottom up algorithm for discrete resource allocation problems ⋮ Gradient methods of maximization of convex functions on discrete structures ⋮ The Boolean quadratic polytope: Some characteristics, facets and relatives ⋮ On the greedy solution in integer linear programming ⋮ Two algorithms for maximizing a separable concave function over a polymatroid feasible region ⋮ Kostengünstige behandlung stoeliastiseher schwankungen der bedarfsgrößen beim transportproblem durch ein niehtlineares diskretes optlmlerangsproblem ⋮ A special stochastic decision problem ⋮ A new filled function method for nonlinear integer programming problem ⋮ Greedy sets and related problems
