Solution of combinatorial optimization problems with minimax criterion

DOI10.1007/BF01069994MaRDI QIDQ4007318zbMATH OpenOpenAlexFDO

Authors M. K. Kravtsov, A. Kh. Sherman

Publication date 27 September 1992

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01069994

zbMATH Keywords

combinatorial optimizationminimax criteriaminimum sum criteriaordered system of criteria

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On combined minmax-minsum optimization
• Minmax combinatorial optimization
• On combinatorial vector optimization problems
• Multicriteria combinatorial optimization problems on a set of polypermutations
• Solving combinatorial problems with combined min-max-min-sum objective and applications

Cites work

• Bottleneck extrema
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)

Cited in

(3)

• Optimization of dynamic programming methods when solving extremal combinatorial problems
• Lexicographic optima in the multicriteria discrete optimization problem
• scientific article; zbMATH DE number 3862930 (Why is no real title available?)

This page was built for publication: Solution of combinatorial optimization problems with minimax criterion

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