scientific article; zbMATH DE number 3751684

MaRDI QIDQ3935744zbMATH OpenFDO

Authors Eberhard Girlich, Michail Michailowitsch Kowaljow

Publication date 1981

zbMATH Keywords

decision makingdiscrete optimizationglobal optimalityGreedy-algorithms for maximum problems of convex functions on discrete latticeslinearization of combinatorical optimization problemsoptimal standardization

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02) Methods of successive quadratic programming type (90C55) Applications of mathematical programming (90C90)

Cited in

(14)

• The Boolean quadratic polytope: Some characteristics, facets and relatives
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region
• Greedy sets and related problems
• 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
• Problems of discrete optimization: challenges and main approaches to solve them
• A new filled function method for nonlinear integer programming problem
• A simple but NP-hard problem of mixed-discrete programming and its solution by approximate algorithms
• Gradient methods of maximization of convex functions on discrete structures
• On the greedy solution in integer linear programming
• Kostengünstige behandlung stoeliastiseher schwankungen der bedarfsgrößen beim transportproblem durch ein niehtlineares diskretes optlmlerangsproblem
• A special stochastic decision problem
• A generalization of Hunter's bound to hypergraphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3935744)