scientific article; zbMATH DE number 4064766

MaRDI QIDQ3798478zbMATH OpenFDO

Authors L. G. Babat, Serge Vlăduţ

Publication date 1987

zbMATH Keywords

\(\epsilon\)-feasible solutionComplexity estimationsmulti-dimensional knapsackseparable discrete optimization

Mathematics Subject Classification ID

Integer programming (90C10) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 4167852
• Estimates of the deviation of approximate solutions from an optimal solution in certain problems of discrete optimization
• scientific article; zbMATH DE number 431495
• Letter to the editor: Comment on Dantzig's paper on discrete variable extremum problems
• Discrete optimization by optimal control methods. I: Separable problems

Cited in

(9)

• On solving discontinuous extremal problems
• Large-scale discrete programming problems: parametrization and analysis of \(\varepsilon\)-approximate algorithms
• Use of random search in solving discrete extremal problems
• Discrete approximation of extremal problems with operator inequality constraints
• scientific article; zbMATH DE number 4167852 (Why is no real title available?)
• The construction of ε-approximate algorithms for the optimization of functions in successively constructed sets
• scientific article; zbMATH DE number 4053351 (Why is no real title available?)
• Letter to the editor: Comment on Dantzig's paper on discrete variable extremum problems
• Estimates of the deviation of approximate solutions from an optimal solution in certain problems of discrete optimization

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 Q3798478)