Standard forms for rational linear arithmetic in constraint logic programming. (Q1354046): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: New Finite Pivoting Rules for the Simplex Method / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The generalized simplex method for minimizing a linear form under linear inequality restraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3818127 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3929386 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Standard forms for rational linear arithmetic in constraint logic programming. / rank | |||
Normal rank | |||
Latest revision as of 11:25, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Standard forms for rational linear arithmetic in constraint logic programming. |
scientific article |
Statements
Standard forms for rational linear arithmetic in constraint logic programming. (English)
0 references
13 May 1997
0 references
constraint logic programming languages
0 references
0 references
