| Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut | 0 | 0.34 | 2020 |
| Tackling Large-Scale and Combinatorial Bi-Level Problems With a Genetic Programming Hyper-Heuristic | 6 | 0.42 | 2020 |
| Contraction-Based Method For Computing A Lower Bound On The Clique Number Of A Graph | 0 | 0.34 | 2019 |
| A New Modeling Approach For The Biobjective Exact Optimization Of Satellite Payload Configuration | 1 | 0.35 | 2019 |
| A Competitive Approach For Bi-Level Co-Evolution | 0 | 0.34 | 2018 |
| Graph coloring approach with new upper bounds for the chromatic number: team building application. | 0 | 0.34 | 2018 |
| A new Co-evolutionary Algorithm Based on Constraint Decomposition | 0 | 0.34 | 2017 |
| Bayesian optimization approach of general bi-level problems. | 2 | 0.37 | 2017 |
| A Novel Co-evolutionary Approach for Constrained Genetic Algorithms. | 0 | 0.34 | 2016 |
| Two bounds of chromatic number in graphs coloring problem | 1 | 0.36 | 2014 |
| Hybrid column generation for large-size Covering Integer Programs: Application to transportation planning | 2 | 0.36 | 2013 |
| Lower bounds for the makespan minimization in job shops | 0 | 0.34 | 2013 |
| Dantzig-Wolfe and Lagrangian Decompositions in Integer Linear Programming | 1 | 0.35 | 2012 |
| Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem | 7 | 0.50 | 2012 |
| A MIP flow model for crop-rotation planning in a context of forest sustainable development. | 11 | 0.73 | 2011 |
| Certification Watermarking For Digital Handheld-Captured Photography | 0 | 0.34 | 2011 |
| Solutions diversification in a column generation algorithm | 3 | 0.44 | 2010 |
| An improving dynamic programming algorithm to solve the shortest path problem with time windows | 3 | 0.42 | 2010 |
| Rapport de recherche sur le problème du plus court chemin contraint | 0 | 0.34 | 2008 |
| Nodal aggregation of resource constraints in a shortest path problem | 5 | 0.50 | 2006 |
| Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem | 8 | 0.49 | 2006 |
| An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual | 3 | 0.44 | 2005 |
| Combining arc-consistency and dual lagrangean relaxation for filtering CSPs | 7 | 0.53 | 2005 |
| Analyse de sensibilité pour les problèmes linéaires en variables 0-1 | 2 | 0.39 | 2003 |
| Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution. | 9 | 0.87 | 1999 |
