A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning

DOI10.1016/S0888-613X(98)10002-6zbMath1044.90510MaRDI QIDQ1606222

Andreas Raggl, Wolfgang Slany

Publication date: 29 July 2002

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (2)

Fuzzy modeling in terms of surprise ⋮ StarFLIP

Uses Software

• FLIP++

Cites Work

• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Comparison of iterative improvement techniques for schedule optimization
• Unnamed Item

This page was built for publication: A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning