Approximate algorithms for generalized maximum utility problems

DOI10.1080/095281398146905MaRDI QIDQ4420772zbMATH OpenOpenAlexFDO

Authors 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

• scientific article; zbMATH DE number 41891 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 194622 (Why is no real title available?)
• Approximation algorithms for combinatorial problems
• Simple Local Search Problems that are Hard to Solve
• Some simplified NP-complete graph problems

This page was built for publication: Approximate algorithms for generalized maximum utility problems

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