 | Monter d'un niveau |
Alarie, S., Audet, C., Jaumard, B., & Savard, G. (1999). Concavity Cuts for Disjoint Bilinear Programming. (Rapport technique n° G-99-38). Lien externe
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (1999). A Branch and Cut Algorithm for Nonconvex Quadratically Constrained Quadratic Programming. (Rapport technique n° G-97-67). Lien externe
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (1999). A Symmetrical Linear Maxmin Approach to Disjoint Bilinear Programming. Mathematical Programming, 85(3), 573-592. Lien externe
Caron, G., Hansen, P., & Jaumard, B. (1999). Assignment Problem With Seniority and Job Priority Constraints. Operations Research, 47(3), 449-453. Lien externe
Hansen, P., Jaumard, B., & Meyer, C. (1999). On Lower Bounds for Numbered Complete Graphs. Discrete Applied Mathematics, 94(1-3), 205-225. Lien externe
Hansen, P., Jaumard, B., & Nguetsé, G.-B. D. (1999). Best Second Order Bounds for Two-Terminal Network Reliability With Dependent Edge Failures. Discrete Applied Mathematics, 97, 375-393. Lien externe
