The following pages link to Gérard Plateau (Q338864):
Displaying 33 items.
- Fast machine reassignment (Q338866) (← links)
- (Q666487) (redirect page) (← links)
- A MIP flow model for crop-rotation planning in a context of forest sustainable development (Q666488) (← links)
- Telecommunication network capacity design for uncertain demand (Q702479) (← links)
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual (Q817197) (← links)
- B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty (Q817201) (← links)
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems (Q1067997) (← links)
- An algorithm for the solution of the 0-1 knapsack problem (Q1156694) (← links)
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem (Q1309925) (← links)
- An exact algorithm for the constraint satisfaction problem: Application to logical inference (Q1313760) (← links)
- An exact algorithm for the 0-1 collapsing knapsack problem (Q1327229) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool (Q1357487) (← links)
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem (Q1761937) (← links)
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem (Q2433806) (← links)
- (Q2776573) (← links)
- (Q3059315) (← links)
- Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models (Q3115997) (← links)
- (Q3661315) (← links)
- (Q3678962) (← links)
- (Q3688101) (← links)
- (Q3942412) (← links)
- (Q4053390) (← links)
- Resolution of the 0–1 knapsack problem: Comparison of methods (Q4074670) (← links)
- Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum (Q4201825) (← links)
- (Q4266523) (← links)
- A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$ (Q4345415) (← links)
- (Q4368562) (← links)
- An Incremental Branch-and-Bound Method for the Satisfiability Problem (Q4427350) (← links)
- Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution (Q4497875) (← links)
- (Q4503045) (← links)
- Dualité lagrangienne en programmation fractionnaire concave-convexe en variables 0–1 (Q4519188) (← links)
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1 (Q5479833) (← links)
