Geodesic

Sommaire

Efficient methods for solving convex programming problems that apply embedding of admissible set in simplexes
p. 3-10
On mobile sets in the binary hypercube
p. 11-21
On decentralized transportation problem
p. 22-30
Nash equilibrium in transport model with quadratic costs
p. 31-42
Variable neighborhood search for two-stage facility location problem
p. 43-57
Optimization of quadruple circulant networks
p. 58-64
Ranking small regular polygons by area and by perimeter
p. 65-73
About f-vectors of pyramidal triangulations of point configurations
p. 74-90