Minimax problems of discrete optimization invariant under majority operators

DOI10.1134/S0965542514080144MaRDI QIDQ2940529zbMATH OpenFDO

Authors B. Flach, E. V. Vodolazskiy, M. Schlesinger

Publication date 26 January 2015

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0965542514080144

zbMATH Keywords

algorithmdiscrete optimizationminimax modification

Mathematics Subject Classification ID

Optimality conditions for minimax problems (49K35)

Recommendations

• Discrete minimization with levels of claims
• An algebraic theory of complexity for discrete optimization.
• scientific article; zbMATH DE number 617944
• scientific article; zbMATH DE number 4147860
• Optimal satisfiability for propositional calculi and constraint satisfaction problems.

Cites work

• Complexity of conservative constraint satisfaction problems
• Handbook of constraint programming.

Cited in

(6)

• Finding a given number of solutions to a system of fuzzy constraints
• Polynomial transformations and data-independent neighborhood functions
• Self-driven algorithm for solving supermodular (,+) labeling problems based on subgradient descent
• Discrete minimization with levels of claims
• scientific article; zbMATH DE number 7142765 (Why is no real title available?)
• Seven problems: so different yet close

This page was built for publication: Minimax problems of discrete optimization invariant under majority operators

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