Plateau Grard

Grard Plateau

Information about the author Grard Plateau will soon be added to the site.
Found 10 papers in total
Problèmes fractionnaires : tour d'horizonsur les applications et méthodes de résolution
Problèmes fractionnaires : tour d'horizonsur les applications et méthodes de résolution
1999
Fractional programming consists in optimizing a ratio of two functions subject to some...
Reoptimization in Lagrangian methods for the 0–1 quadratic knapsack problem
Reoptimization in Lagrangian methods for the 0–1 quadratic knapsack problem
2012
The 0–1 quadratic knapsack problem consists of maximizing a quadratic objective...
Enhancing a branch-and-bound algorithm for two-stage stochastic integer network design-based models
Enhancing a branch-and-bound algorithm for two-stage stochastic integer network design-based models
2006
In this paper we present branch-and-bound (B&B) strategies for two-stage...
An adapted step size algorithm for a 0–1 biknapsack Lagrangean dual
An adapted step size algorithm for a 0–1 biknapsack Lagrangean dual
2005
This paper deals with a new algorithm for a 0–1 bidimensional knapsack...
Fractional programming: a guided tour of applications and solution methods
Fractional programming: a guided tour of applications and solution methods
1999
Fractional programming consists in optimizing a ratio of two functions subject to some...
Sensitivity analysis for binary integer programs
Sensitivity analysis for binary integer programs
2003
This paper is a state of the art on sensitivity analysis for 0–1 linear...
A Lagrangean decomposition for 0–1 hyperbolic programming problems
A Lagrangean decomposition for 0–1 hyperbolic programming problems
2000
This paper deals with the solution of the 0–1 hyperbolic programming problem...
The 0–1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
The 0–1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
1996
Efficient codes exist for exactly solving the 0–1 knapsack problem, which is a...
An incremental branch-and-bound method for the satisfiability problem
An incremental branch-and-bound method for the satisfiability problem
1998
The satisfiability problem is to check whether a set of clauses in propositional logic...
An exact search for the solution of the surrogate dual of te 0-1 bidimensional knapsack problem
An exact search for the solution of the surrogate dual of te 0-1 bidimensional knapsack problem
1993
The surrogate dual of the 0-1 bidimensional knapsack problem is exactly solved by an...
Papers per page: