- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j8 |      | Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès: Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm. Algorithmica 63(1-2): 551-567 (2012) |
| 2011 | ||
| j7 | | Thierry Benoist, Bertrand Estellon, Frédéric Gardi, Romain Megel, Karim Nouioua: LocalSolver 1.x: a black-box local-search solver for 0-1 programming. 4OR 9(3): 299-316 (2011) |
| c4 | | Frédéric Gardi, Karim Nouioua: Local Search for Mixed-Integer Nonlinear Optimization: A Methodology and an Application. EvoCOP 2011: 167-178 |
| i1 | | Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès: Bidirected minimum Manhattan network problem. CoRR abs/1107.1359 (2011) |
| 2010 | ||
| j6 | | Victor Chepoi, Karim Nouioua, Edouard Thiel, Yann Vaxès: Pareto Envelopes in Simple Polygons. Int. J. Comput. Geometry Appl. 20(6): 707-721 (2010) |
| 2009 | ||
| c3 | | Bertrand Estellon, Frédéric Gardi, Karim Nouioua: High-Performance Local Search for Task Scheduling with Human Resource Allocation. SLS 2009: 1-15 |
| 2008 | ||
| j5 | | Bertrand Estellon, Frédéric Gardi, Karim Nouioua: Two local search approaches for solving real-life car sequencing problems. European Journal of Operational Research 191(3): 928-944 (2008) |
| j4 | | Victor Chepoi, Karim Nouioua, Yann Vaxès: A rounding algorithm for approximating minimum Manhattan networks. Theor. Comput. Sci. 390(1): 56-69 (2008) |
| 2007 | ||
| c2 | | Victor Chepoi, Karim Nouioua: Pareto envelopes in R3 under l1 and linfinity distance functions. Symposium on Computational Geometry 2007: 284-293 |
| 2006 | ||
| j3 | | Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès: Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints. Algorithmica 45(2): 209-226 (2006) |
| j2 | | Bertrand Estellon, Frédéric Gardi, Karim Nouioua: Large neighborhood improvements for solving car sequencing problems. RAIRO - Operations Research 40(4): 355-379 (2006) |
| 2005 | ||
| j1 | | Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès: Mixed covering of trees and the augmentation problem with odd diameter constraints. Electronic Notes in Discrete Mathematics 22: 405-408 (2005) |
| c1 | | Victor Chepoi, Karim Nouioua, Yann Vaxès: A Rounding Algorithm for Approximating Minimum Manhattan Networks. APPROX-RANDOM 2005: 40-51 |
| 1 | Thierry Benoist | |
| 2 | Nicolas Catusse | |
| 3 | Victor Chepoi | |
| 4 | Bertrand Estellon | |
| 5 | Frédéric Gardi | |
| 6 | Romain Megel | |
| 7 | Edouard Thiel | |
| 8 | Yann Vaxès |
Data released under the ODC-BY 1.0 license — See also our legal information page