| Publication | Date of Publication | Type |
|---|
Fast machine reassignment
Annals of Operations Research | 2016-11-07 | Paper |
Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
Computers & Operations Research | 2012-11-15 | Paper |
A MIP flow model for crop-rotation planning in a context of forest sustainable development
Annals of Operations Research | 2012-03-08 | Paper |
Enhancing a branch-and-bound algorithm for two-stage stochastic integer network design-based models
Management Science | 2012-02-21 | Paper |
| \(0\)-\(1\) knapsack problems | 2010-12-08 | Paper |
Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
Discrete Applied Mathematics | 2006-10-30 | Paper |
Analyse de sensibilité pour les problèmes linéaires en variables 0-1
RAIRO - Operations Research | 2006-07-11 | Paper |
Analyse de sensibilité pour les problèmes linéaires en variables 0-1
RAIRO - Operations Research | 2006-07-11 | Paper |
B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
Annals of Operations Research | 2006-03-07 | Paper |
An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
Annals of Operations Research | 2006-03-07 | Paper |
Telecommunication network capacity design for uncertain demand
Computational Optimization and Applications | 2005-01-17 | Paper |
| New heuristics for the Euclidean Steiner problem in \(\mathbb{R}^n\) | 2003-03-12 | Paper |
| scientific article; zbMATH DE number 1501879 (Why is no real title available?) | 2002-11-07 | Paper |
Dualité lagrangienne en programmation fractionnaire concave-convexe en variables 0–1
Comptes Rendus de l'Académie des Sciences - Series I - Mathematics | 2001-03-05 | Paper |
Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution
RAIRO - Operations Research | 2000-08-24 | Paper |
| scientific article; zbMATH DE number 1346500 (Why is no real title available?) | 1999-10-04 | Paper |
An Incremental Branch-and-Bound Method for the Satisfiability Problem
INFORMS Journal on Computing | 1998-01-01 | Paper |
| scientific article; zbMATH DE number 1094771 (Why is no real title available?) | 1997-12-04 | Paper |
A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$
RAIRO - Operations Research | 1997-09-02 | Paper |
The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
Journal of Heuristics | 1997-06-10 | Paper |
An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
Discrete Applied Mathematics | 1994-06-15 | Paper |
An exact algorithm for the 0-1 collapsing knapsack problem
Discrete Applied Mathematics | 1994-06-15 | Paper |
An exact algorithm for the constraint satisfaction problem: Application to logical inference
Information Processing Letters | 1994-03-22 | Paper |
An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
European Journal of Operational Research | 1993-12-20 | Paper |
Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
RAIRO - Operations Research | 1993-08-29 | Paper |
Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
European Journal of Operational Research | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3900494 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3912106 (Why is no real title available?) | 1984-01-01 | Paper |
An algorithm for the solution of the 0-1 knapsack problem
Computing | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3813350 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3759567 (Why is no real title available?) | 1978-01-01 | Paper |
Resolution of the 0–1 knapsack problem: Comparison of methods
Mathematical Programming | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3468554 (Why is no real title available?) | 1974-01-01 | Paper |
