L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing.
La conjecture des soufflets
On sait depuis les travaux de Bricard et de Connelly qu’il existe dans l’espace euclidien des polyèdres (non convexes) qui sont flexibles : on peut les déformer continûment sans changer la forme de leurs faces. La conjecture des soufflets affirme que le volume interieur de ces polyèdres est constant au cours de la déformation. Elle a été démontrée récemment par I. Sabitov, qui a pour cela utilisé des outils algébriques inattendus dans ce contexte.
Labeled shortest paths in digraphs with negative and positive edge weights
This paper gives a shortest path algorithm for CFG (context free grammar) labeled and weighted digraphs where edge weights may be positive or negative, but negative-weight cycles are not allowed in the underlying unlabeled graph. These results build directly on an algorithm of Barrett et al. [SIAM J. Comput.30 (2000) 809–837]. In addition to many other results, they gave a shortest path algorithm for CFG labeled and weighted digraphs where all edges are nonnegative. Our algorithm is based closely...
Lagrangean decomposition for integer programming : theory and applications
Large convexly independent subsets of Minkowski sums.
Large equiangular sets of lines in euclidean space.
Large equilateral triangles inscribed in the unit disk of a Minkowski plane.
Largest j-Simplices in n-Polytopes.
Lattice Inequalities for Convex Bodies and Arbitrary Lattices.
Lattice packings with gap defects are not completely saturated.
Lattice Points in Lattice Polytopes.
Lattice points in Minkowski sums.
Lattice Points on Convex Curves.
Lattice tilings by cubes: Whole, notched and extended.
Lattice-Free Polytopes and Their Diameter.
Layered circle packings.
Least deviation decomposition with respect to a pair of convex sets.
Length-preserving deformations of closed plane curvesc
Les cinq métamorphoses des surfaces pavées
Les (e...,...,e...)-convexes de R...; la proprieté d'intersection et les filtres maximaux de convexes.