A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning
type: Item
instance of: scholarly article
title: A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning
zbMATH Open document ID: 1044.90510
DOI: 10.1016/S0888-613X(98)10002-6
author: Andreas Raggl
author: Wolfgang Slany
published in: International Journal of Approximate Reasoning
publication date: 2002-07-29T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68T37
zbMATH DE Number: 1770814
describes a project that uses: FLIP++
MaRDI profile type: Publication
cites work: Comparison of iterative improvement techniques for schedule optimization
cites work: Q3995531
cites work: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
description: scientific article; zbMATH DE number 1770814