Discrete minimization with levels of claims

DOI10.1080/00207728908910219MaRDI QIDQ3835305zbMATH OpenOpenAlexFDO

Authors S. N. Butko

Publication date 1989

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207728908910219

zbMATH Keywords

complexity degreediscrete optimizationpolynomial time complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Recommendations

• Minimax problems of discrete optimization invariant under majority operators
• Completeness of vector discrete optimization problems
• Polynomial Algorithms for a Class of Discrete Minmax Linear Programming Problems
• scientific article; zbMATH DE number 3976782
• Complexity of discrete multicriteria problems

Cited in

(1)

• Minimax problems of discrete optimization invariant under majority operators

This page was built for publication: Discrete minimization with levels of claims

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