Gérard Plateau

According to our database1, Gérard Plateau authored at least 18 papers between 1975 and 2016.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
Fast machine reassignment.
Ann. Oper. Res., 2016

2012
Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem.
Comput. Oper. Res., 2012

2011
A MIP flow model for crop-rotation planning in a context of forest sustainable development.
Ann. Oper. Res., 2011

2006
Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models.
Manag. Sci., 2006

Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem.
Discret. Appl. Math., 2006

2005
An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual.
Ann. Oper. Res., 2005

B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty.
Ann. Oper. Res., 2005

2004
Telecommunication Network Capacity Design for Uncertain Demand.
Comput. Optim. Appl., 2004

2003
Analyse de sensibilité pour les problèmes linéaires en variables 0-1.
RAIRO Oper. Res., 2003

1999
Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution.
RAIRO Oper. Res., 1999

1998
An Incremental Branch-and-Bound Method for the Satisfiability Problem.
INFORMS J. Comput., 1998

1996
The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool.
J. Heuristics, 1996

1994
An Efficient Preprocessing Procedure for the Multidimensional 0- 1 Knapsack Problem.
Discret. Appl. Math., 1994

An Exact Algorithm for the 0- 1 Collapsing Knapsack Problem.
Discret. Appl. Math., 1994

1993
An Exact Algorithm for the Constraint Satisfaction Problem: Application to Logical Inference.
Inf. Process. Lett., 1993

1991
Theorem Proving by Combinatorial Optimization.
Proceedings of the Word Equations and Related Topics, Second International Workshop, 1991

1982
An algorithm for the solution of the 0-1 knapsack problem.
Computing, 1982

1975
Resolution of the 0-1 knapsack problem: Comparison of methods.
Math. Program., 1975


  Loading...