Solving linear, min and max constraint systems using CLP based on relational interval arithmetic (Q1391939)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving linear, min and max constraint systems using CLP based on relational interval arithmetic |
scientific article; zbMATH DE number 1178645
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving linear, min and max constraint systems using CLP based on relational interval arithmetic |
scientific article; zbMATH DE number 1178645 |
Statements
Solving linear, min and max constraint systems using CLP based on relational interval arithmetic (English)
0 references
23 July 1998
0 references
constraint satisfaction problems
0 references
0.8677465
0 references
0.8511648
0 references
0.8476578
0 references
0.84378463
0 references
0.8421874
0 references
0 references
0.8390689
0 references
