Gérard Plateau

发表

New Heuristics for the Euclidean Steiner Problem in R n

Nelson Maculan, Patrick Boucher, Flávio Montenegro, 2002 .

An algorithm for the solution of the 0–1 knapsack problem

Gérard Plateau, Didier Fayard, 2005, Computing.

Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution

Anass Nagih, Gérard Plateau, Anass Nagih, 1999, RAIRO Oper. Res..

An Exact Algorithm for the Constraint Satisfaction Problem: Application to Logical Inference

Hachemi Bennaceur, Gérard Plateau, 1993, Inf. Process. Lett..

Analyse de sensibilité pour les problèmes linéaires en variables 0-1

Anass Nagih, Gérard Plateau, Babacar Thiongane, 2003, RAIRO Oper. Res..

B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty

Abdel Lisser, Nelson Maculan, Gérard Plateau, 2005, Ann. Oper. Res..

0–1 Knapsack Problems

Anass Nagih, Gérard Plateau, 2014 .

Theorem Proving by Combinatorial Optimization

Hachemi Bennaceur, Gérard Plateau, 1991, IWWERT.

Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models

Abdel Lisser, Nelson Maculan, Gérard Plateau, 2006, Manag. Sci..

An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual

Anass Nagih, Gérard Plateau, Babacar Thiongane, 2005, Ann. Oper. Res..

An Incremental Branch-and-Bound Method for the Satisfiability Problem

Hachemi Bennaceur, Gérard Plateau, Idir Gouachi, 1998, INFORMS J. Comput..

Improved time and space complexity for Kianfar's inequality rotation algorithm

Moussa Elkihel, Gérard Plateau, D. El Baz, 2006 .

Un outil générique d'aide à la décision pour la gestion des locomotives fret à la SNCF

Anass Nagih, Gérard Plateau, Laurent Alfandari, 2004 .

A MIP flow model for crop-rotation planning in a context of forest sustainable development

Anass Nagih, Gérard Plateau, Laurent Alfandari, 2011, Ann. Oper. Res..

Fast machine reassignment

Camille Coti, Frédéric Roupin, Gérard Plateau, 2016, Ann. Oper. Res..

Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem

Anass Nagih, Gérard Plateau, Babacar Thiongane, 2006, Discret. Appl. Math..

Algorithms and complexity for parametric 0-1 linear programs relative to the objective function

Anass Nagih, Gérard Plateau, Babacar Thiongane, 2003 .

An Exact Algorithm for the 0- 1 Collapsing Knapsack Problem

Gérard Plateau, Didier Fayard, 1994, Discret. Appl. Math..

Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem

Anass Nagih, Gérard Plateau, Lucas Létocart, 2012, Comput. Oper. Res..

The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool

Arnaud Fréville, Gérard Plateau, A. Fréville, 1996, J. Heuristics.

An Extension of Nested Satisfiability

Pierre Hansen, Brigitte Jaumard, Gérard Plateau, 1993 .

An Efficient Preprocessing Procedure for the Multidimensional 0- 1 Knapsack Problem

Arnaud Fréville, Gérard Plateau, A. Fréville, 1994, Discret. Appl. Math..

Note---On “An Efficient Algorithm for the 0-1 Knapsack Problem, by Robert M. Nauss”

Gérard Plateau, Didier Fayard, 1978 .

A MIP flow model for crop rotation planning in a sustainable development context

Anass Nagih, Gérard Plateau, Laurent Alfandari, 2006 .

A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$

Michel Minoux, Nelson Maculan, Gérard Plateau, 1997 .

Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems

Abdel Lisser, Nelson Maculan, Gérard Plateau, 2003 .

An efficient hybrid heuristic method for the 0-1 exact k-item quadratic knapsack problem

Gérard Plateau, Lucas Létocart, Marie-Christine Plateau, 2014 .