![]() | Monter d'un niveau |
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (2000). A Branch and Cut Algorithm for Nonconvex Quadratically Constrained Quadratic Programming. Mathematical Programming, 87(1), 131-152. Lien externe
Hansen, P., Jaumard, B., De Aragao, M. P., Chauny, F., & Perron, S. (2000). Probabilistic Satisfiability With Imprecise Probabilities. International Journal of Approximate Reasoning, 24(2-3), 171-189. Lien externe
Merle, O. D., Hansen, P., Jaumard, B., & Mladenovic, N. (2000). An interior point algorithm for minimum sum-of-squares clustering. SIAM Journal on Scientific Computing, 21(4), 1485-1505. Lien externe
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (2000). A Branch and Cut Algorithm for Nonconvex Quadratically Constrained Quadratic Programming. Mathematical Programming, 87(1), 131-152. Lien externe
Hansen, P., Jaumard, B., De Aragao, M. P., Chauny, F., & Perron, S. (2000). Probabilistic Satisfiability With Imprecise Probabilities. International Journal of Approximate Reasoning, 24(2-3), 171-189. Lien externe
Merle, O. D., Hansen, P., Jaumard, B., & Mladenovic, N. (2000). An interior point algorithm for minimum sum-of-squares clustering. SIAM Journal on Scientific Computing, 21(4), 1485-1505. Lien externe
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (2000). A Branch and Cut Algorithm for Nonconvex Quadratically Constrained Quadratic Programming. Mathematical Programming, 87(1), 131-152. Lien externe
Hansen, P., & Jaumard, B. (2000). Probabilistic Satisfiability. Dans Handbook of Defeasible Reasoning and Uncertainty Management Systems: Algorithms for Uncertainty and Defeasible Reasoning (p. 321-367). Lien externe