Finding a given number of solutions to a system of fuzzy constraints

DOI10.1007/s10559-018-0007-2zbMath1384.93072OpenAlexW2786391542MaRDI QIDQ1745696

B. Flach, E. V. Vodolazskiy, Michail I. Schlesinger

Publication date: 18 April 2018

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-018-0007-2

zbMATH Keywords

labelinginvariantsminimax problemsdiscrete optimizationpolymorphisms

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Fuzzy control/observation systems (93C42)

Cites Work

• Unnamed Item
• Unnamed Item
• Enumerating homomorphisms
• Minimizing a sum of submodular functions
• Constraints, consistency and closure
• Time bounds for selection
• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• Reduction operations in fuzzy or valued constraint satisfaction
• Structural tractability of enumerating CSP solutions
• Nonserial dynamic programming
• Minimax problems of discrete optimization invariant under majority operators
• Beyond Hypertree Width: Decomposition Methods Without Decompositions
• Finding the k Shortest Paths
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem

This page was built for publication: Finding a given number of solutions to a system of fuzzy constraints