论文信息 - Use of Relational Operators for Algorithm Development

Use of Relational Operators for Algorithm Development

We examine the use of the relational limit operator for the so luti n of combinatorial problems. In particular, the first developmental steps from specifications and the construction of feasible solutions are considered.

Sharon A. Curtis

[1] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..

[2] Donald E. Knuth,et al. A simple program whose proof isn't , 1990 .

[3] Grant Malcolm,et al. Algebraic Data Types and Program Transformation , 1990 .

[4] Sharon A. Curtis,et al. A Relational Approach To Optimization Problems , 1996 .

[5] B. Korte,et al. Greedoids and Linear Objective Functions , 1984 .

[6] László Lovász,et al. Mathematical Structures Underlying Greedy Algorithms , 1981, International Symposium on Fundamentals of Computation Theory.

[7] Edsger W. Dijkstra,et al. A method of programming , 1988 .