Approximate algorithms for generalized maximum utility problems

DOI10.1080/095281398146905zbMath1055.68568OpenAlexW1968756906MaRDI QIDQ4420772

F. J. Jüngen, Wojciech Kowalczyk

Publication date: 1998

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

constraint satisfaction problems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Approximation algorithms for combinatorial problems
• Some simplified NP-complete graph problems
• Simple Local Search Problems that are Hard to Solve
• Unnamed Item
• Unnamed Item
• Unnamed Item