 | Monter d'un niveau |
Alarie, S., Audet, C., Jaumard, B., & Savard, G. (2001). Concavity Cuts for Disjoint Bilinear Programming. Mathematical Programming, 90(2), 373-398. Lien externe
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (2001). Enumeration of All Extreme Equilibria of Bimatrix Games. SIAM Journal on Scientific Computing, 23(1), 323-338. Lien externe
Barbera, V., & Jaumard, B. (2001). Design of an Efficient Channel Block Retuning. Mobile Networks & Applications, 6(6), 501-510. Lien externe
Galinier, P., Jaumard, B., Morales, R., & Pesant, G. (janvier 2001). Constraint-based approach to the Golomb ruler problem [Communication écrite]. 3rd International Workshop on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2001), Ashford, UK. Non disponible
Jaumard, B., & Meyer, C. (2001). On the Convergence of Cone Splitting Algorithms With Omega- Subdivisions. Journal of Optimization Theory and Applications, 110(1), 119-144. Lien externe
Jaumard, B., Marcotte, O., Meyer, C., & Vovor, T. (2001). Comparison of Column Generation Models for Channel Assignment in Cellular Networks. Discrete Applied Mathematics, 112(1-3), 217-240. Lien externe
