Geodesic

Tome 31 (2024) no. 4

Sommaire

A branch, bound, and cuts algorithm for the dynamic competitive facility location problem
p. 5-26
A greedy algorithm for the resource-constrained project scheduling problem
p. 27-39
Approximation algorithms for graph clustering problems with clusters of bounded size
p. 40-57
The number of impossible additive differentials for the composition of XOR and bit rotation
p. 58-89
Updated estimates for algorithms for packing $2$-bar charts in a strip
p. 90-115
Variable neighborhood descent for finding the threshold stability radius in the facility location and discriminatory pricing problem
p. 116-133
An algorithm to search a solution to the production scheduling problem
p. 134-150
On the complexity of fanout-bounded parallel prefix circuits
p. 151-167
Methods of nonsmooth analysis in application to the problem of minimizing the sum of affine functions' modules
p. 168-185
Decomposition approach for a two echelon inventory management system
p. 186-212