Geodesic

Tome 22 (2015) no. 4

Sommaire

Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded from below
p. 5-20
About density of a covering of a strip with identical sectors
p. 21-34
The complexity of the project scheduling problem with credits
p. 35-49
An exact pseudopolynomial algorithm for a bi-partitioning problem
p. 50-62
Effective algorithms for one scheduling problem on two machines with makespan minimization
p. 63-79