Gérard Plateau

18 papers Journal 17Unranked 1
YearRankTypeTitle / Venue / Authors
2016 J jnl
Fast machine reassignment.
Ann. Oper. Res.
Franck Butelle, Laurent Alfandari, Camille Coti, Lucian Finta, Lucas Létocart, Gérard Plateau, Frédéric Roupin, Antoine Rozenknop, Roberto Wolfler Calvo
2012 J jnl
Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem.
Comput. Oper. Res.
Lucas Létocart, Anass Nagih, Gérard Plateau
2011 J jnl
A MIP flow model for crop-rotation planning in a context of forest sustainable development.
Ann. Oper. Res.
Laurent Alfandari, J. L. Lemalade, Anass Nagih, Gérard Plateau
2006 J jnl
Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models.
Manag. Sci.
Rafael Andrade, Abdel Lisser, Nelson Maculan, Gérard Plateau
2006 J jnl
Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem.
Discret. Appl. Math.
Babacar Thiongane, Anass Nagih, Gérard Plateau
2005 J jnl
An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual.
Ann. Oper. Res.
Babacar Thiongane, Anass Nagih, Gérard Plateau
2005 J jnl
B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty.
Ann. Oper. Res.
Rafael Andrade, Abdel Lisser, Nelson Maculan, Gérard Plateau
2004 J jnl
Telecommunication Network Capacity Design for Uncertain Demand.
Comput. Optim. Appl.
Rafael Andrade, Abdel Lisser, Nelson Maculan, Gérard Plateau
2003 J jnl
Analyse de sensibilité pour les problèmes linéaires en variables 0-1.
RAIRO Oper. Res.
Babacar Thiongane, Anass Nagih, Gérard Plateau
1999 J jnl
Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution.
RAIRO Oper. Res.
Anass Nagih, Gérard Plateau
1998 J jnl
An Incremental Branch-and-Bound Method for the Satisfiability Problem.
INFORMS J. Comput.
Hachemi Bennaceur, Idir Gouachi, Gérard Plateau
1996 J jnl
The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool.
J. Heuristics
Arnaud Fréville, Gérard Plateau
1994 J jnl
An Efficient Preprocessing Procedure for the Multidimensional 0- 1 Knapsack Problem.
Discret. Appl. Math.
Arnaud Fréville, Gérard Plateau
1994 J jnl
An Exact Algorithm for the 0- 1 Collapsing Knapsack Problem.
Discret. Appl. Math.
Didier Fayard, Gérard Plateau
1993 J jnl
An Exact Algorithm for the Constraint Satisfaction Problem: Application to Logical Inference.
Inf. Process. Lett.
Hachemi Bennaceur, Gérard Plateau
1991 — conf
Theorem Proving by Combinatorial Optimization.
IWWERT
Hachemi Bennaceur, Gérard Plateau
1982 J jnl
An algorithm for the solution of the 0-1 knapsack problem.
Computing
Didier Fayard, Gérard Plateau
1975 J jnl
Resolution of the 0-1 knapsack problem: Comparison of methods.
Math. Program.
Didier Fayard, Gérard Plateau