767 articles – 1380 references  [version française]
.:. Browse > List by year > 2000 .:.
18 documents ordered by :
1 - 2 Next Last
On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
Miller A. J., Nemhauser G. L., Savelsbergh M. W.P.
European Journal of Operational Research (2000) 298-315 [hal-00387119 - version 1]
fulltext access Surfaces de Riemann parfaites en petit genre
Casamayou A.
Université Sciences et Technologies - Bordeaux I (12/07/2000), Bavard Christophe (Dir.) [tel-00005446 - version 1]
Monomial bases and the n! conjecture,.
Aval J.-C.
Dans Formal Power Series and Algebraic Combinatorics - FPSAC'00, Russie, Fédération De (2000) [hal-00353522 - version 1]
Algèbre Linéaire Creuse Hautes Performances : Application à la Mécanique des Structures
Goudin D., Hénon P., Pellegrini F., Ramet P., Roman J., Pesqué J.-J.
iHPerf'2000, France (2000) [inria-00346604 - version 1]
Description of the EMILIO Software Processing Chain and Application to Structural Mechanics
Goudin D., Hénon P., Pellegrini F., Ramet P., Roman J., Pesqué J.-J.
PMAA'2K, Suisse (2000) [inria-00346601 - version 1]
PaStiX: A High-Performance Parallel Direct Solver for Sparse Symmetric Definite Systems
Hénon P., Ramet P., Roman J.
PMAA'2K, Suisse (2000) [inria-00346600 - version 1]
PaStiX: A Parallel Sparse Direct Solver Based on a Static Scheduling for Mixed 1D/2D Block Distributions
Hénon P., Ramet P., Roman J.
Irregular'2000 workshop of IPDPS, Mexique (2000) [inria-00346594 - version 1]
Parallel Sparse Linear Algebra and Application to Structural Mechanics
Goudin D., Hénon P., Pellegrini F., Ramet P., Roman J., Pesqué J.-J.
Numerical Algorithms 24 (2000) 371--391 [inria-00346016 - version 1]
On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
Vanderbeck F.
Operations Research 48, 1 (2000) 111-128 [inria-00342641 - version 1]
Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
Vanderbeck F.
Operations Research 45, 5 (2000) 915-926 [inria-00342639 - version 1]