scientific article; zbMATH DE number 895365

MaRDI QIDQ4883377zbMATH OpenFDO

Authors Gang Yu, Panagiotis Kouvelis

Publication date 1995

zbMATH Keywords

min-max objective functionsminimum spanning treeproduction controlpseudo-polynomial algorithmsresource allocationrobust optimizationseparable cost functions

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60) Game theory (91A99)

Recommendations

• Min-max optimization of several classical discrete optimization problems
• Minmax combinatorial optimization
• A Min-Max-Sum Resource Allocation Problem and Its Applications
• Asignacion de recuerdos max-min: Propiedades y algoritmos
• scientific article; zbMATH DE number 3845343

Cited in

(7)

• Min-max optimization of several classical discrete optimization problems
• Weighted optimization for multiobjective full-information control problems
• On the resolution of certain discrete univariate max-min problems
• scientific article; zbMATH DE number 175722 (Why is no real title available?)
• Optimality conditions for nondifferentiable minimax programs and vector optimization problems
• Optimality and duality in nondifferentiable minimax programming problems involving \(\epsilon\)-quasi solutions
• Combinatorial algorithms for the minmax robust median subtree problem on tree networks with interval vertex weights

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