 | Monter d'un niveau |
Alarie, S., Audet, C., Garnier, V., Le Digabel, S., & Leclaire, L.-A. (2011). Snow Water Equivalent Estimation Using Blackbox Optimization. (Rapport technique n° G-2011-09). Lien externe
Aloise, D., & Hansen, P. (2011). Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering. Journal of Global Optimization, 49(3), 449-465. Lien externe
Aloise, D., Caporossi, G., Hansen, P., Liberti, L., Perron, S., & Ruiz, M. (2011). Modularity Maximization in Networks by Variable Neighborhood Search. (Rapport technique n° G-2011-59). Lien externe
Anjos, M. F., & Liers, F. (2011). Global Approaches for Facility Layout and VLSI Floorplanning. (Rapport technique n° G-2011-34). Lien externe
Anjos, M. F., & Vieira, M. V. C. (2011). Semidefinite resolution and exactness of semidefinite relaxations for satisfiability. (Rapport technique n° G-2011-35). Lien externe
Archetti, C., Bianchessi, N., Hertz, A., & Speranza, M. G. (2011). Incomplete Service and Split Deliveries in a Routing Problem with Profits. (Rapport technique n° G-2011-02). Lien externe
Armand, P., Benoist, J., & Orban, D. (2011). From Global to Local Convergence of Interior Methods for Nonlinear Optimization. (Rapport technique n° G-2008-59). Lien externe
Audet, C., Dang, K.-C., & Orban, D. (2011). Efficient Use of Parallelism in Algorithmic Parameter Optimization Applications. (Rapport technique n° G-2011-03). Lien externe
Audet, C., Guillou, A., Hansen, P., Messine, F., & Perron, S. (2011). The small hexagon and heptagon with maximum sum of distances between vertices. Journal of Global Optimization, 49(3), 467-480. Lien externe
Audet, C., Hansen, P., & Perron, S. (2011). Remarks on solutions to a nonconvex quadratic programming test problem. Journal of Global Optimization, 50(2), 363-369. Lien externe
Azarfar, A., Frigon, J.-F., & Sanso, B. (2011). Analysis of Cognitive Radio Networks Based on a Queueing Model with Server Interruptions. (Rapport technique n° G-2011-93). Lien externe
Azarfar, A., Frigon, J.-F., & Sanso, B. (2011). A Greedy Channel Restoration Scheme for Opportunistic Spectrum Access. (Rapport technique n° G-2011-91). Lien externe
Azarfar, A., Frigon, J.-F., & Sanso, B. (2011). Hierarchical Channel Recovery in Cognitive Radio Networks. (Rapport technique n° G-2011-95). Lien externe
Azarfar, A., Frigon, J.-F., & Sanso, B. (2011). History-Aware Channel Search Schemes in Cognitive Radio Networks. (Rapport technique n° G-2011-90). Lien externe
Azarfar, A., Frigon, J.-F., & Sanso, B. (2011). A History-Aware Greedy Channel Restoration Scheme for Cognitive Radio-Based LTE Networks. (Rapport technique n° G-2011-92). Lien externe
Azarfar, A., Frigon, J.-F., & Sanso, B. (2011). Improving the Reliability of Wireless Networks Using Cognitive Radios. (Rapport technique n° G-2011-89). Lien externe
Azarfar, A., Frigon, J.-F., & Sanso, B. (2011). A Performance Comparison of Cognitive Versus Traditional Radio Networks. (Rapport technique n° G-2011-88). Lien externe
Azarfar, A., Frigon, J.-F., & Sanso, B. (2011). Reliability Analysis of a Channel Restoration Mechanism for Opportunistic Spectrum Access. (Rapport technique n° G-2011-94). Lien externe
Ben Guedria, S., Sanso, B., & Frigon, J.-F. (2011). PolyMAX, a Mobile WiMAX Module for the ns-2 Simulator with QoS and AMC Support. (Rapport technique n° G-2011-76). Lien externe
Benavent, E., Corberán, Á., Desaulniers, G., Lessard, F., Plana, I., & Sanchis, J. M. (2011). A Branch-Price-and-Cut Algorithm for the Min-Max k-Vehicle Windy Rural Postman Problem. (Rapport technique n° G-2011-65). Lien externe
Bernardi, S., & Anjos, M. F. (2011). A Three-Stage Mathematical-Programming Method for the Multi-Floor Facility Layout Problem. (Rapport technique n° G-2011-05). Lien externe
Boiardi, S., Capone, A., & Sanso, B. (2011). Joint Design and Management of Energy-Aware Mesh Networks. (Rapport technique n° G-2011-96). Lien externe
Bolouki, S., & Malhamé, R. P. (juin 2011). On consensus with a general discrete time convex combination based algorithm for multi-agent systems [Communication écrite]. 19th Mediterranean Conference on Control and Automation (MED 2011), Corfu, Greece. Lien externe
Bolouki, S., & Malhamé, R. P. (août 2011). On the Limiting Behavior of Linear or Convex Combination Based Updates of Multi-Agent Systems [Communication écrite]. IFAC 18th World Congress, Milano, Italy. Publié dans IFAC Proceedings Volumes, 44(1). Lien externe
Conn, A. R., & Le Digabel, S. (2011). Use of quadratic models with mesh adaptive direct search for constrained black box optimization. (Rapport technique n° G-2011-11). Lien externe
Costanzo, G. T., Zhu, G., Anjos, M. F., & Savard, G. (2011). A System Architecture for Autonomous Demand Side Load Management in the Smart Grid. (Rapport technique n° G-2011-68). Lien externe
Coulibaly, Z., & Orban, D. (2011). An ℓ₁ Elastic Interior-Point Method for Mathematical Programs with Complementarity Constraints. (Rapport technique n° G-2009-74). Lien externe
Dahmouni, H., El Ghazi, H., Bonacci, D., Sanso, B., & Girard, A. (2011). Improving QoS of all-IP Generation of Pre-WiMax Networks Using Delay-Jitter Model. (Rapport technique n° G-2011-19). Lien externe
Desaulniers, G., Desrosiers, J., & Spoorendonk, S. (2011). Cutting planes for branch-and-price algorithms. Networks, 58(4), 301-310. Lien externe
El Hallaoui, I., Metrane, A., Desaulniers, G., & Soumis, F. (2011). An Improved Primal Simplex Algorithm for Degenerate Linear Programs. INFORMS Journal on Computing, 23(4), 569-577. Lien externe
Elahipanah, M., Desaulniers, G., & Lacasse-Guay, È. (2011). Two-Phase Mathematical-Programming Heuristic for Flexible Assignment of Activities and Tasks to Work Shifts. (Rapport technique n° G-2011-23). Lien externe
Engau, A., & Anjos, M. F. (2011). A Primal-Dual Interior-Point Algorithm for Linear Programming with Selective Addition of Inequalities. (Rapport technique n° G-2011-44). Lien externe
Engau, A., Anjos, M. F., & Bomze, I. (2011). An Interior-Point Algorithm with Selective Addition of Inequalities for Solving Doubly Non-Negative Relaxations of Maximum-Stable-Set and Maximum-Clique Problems. (Rapport technique n° G-2011-08). Lien externe
Fernandes, I. F., Aloise, D., Aloise, D. J., Hansen, P., & Liberti, L. (2011). On the Weber Facility Location Problem with Limited Distances and Side Constraints. (Rapport technique n° G-2011-18). Lien externe
Friedlander, M. P., & Orban, D. (2011). A Primal-Dual Regularized Interior-Point Method for Convex Quadratic Programs. (Rapport technique n° G-2010-47). Lien externe
Galinier, P., Hertz, A., Paroz, S., & Pesant, G. (2011). Using local search to speed up filtering algorithms for some NP-hard constraints. Annals of Operations Research, 184(1), 121-135. Lien externe
Ghaddar, B., Vera, J. C., & Anjos, M. F. (juin 2011). An iterative scheme for valid polynomial inequality generation in binary polynomial programming [Communication écrite]. 15th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2011), New York, NY, United states. Lien externe
Gheribi, A. E., Robelin, C., Le Digabel, S., Audet, C., & Pelton, A. (2011). Calculating all local minima on liquidus surfaces using the FactSage software and databases and the Mesh Adaptive Direct Search algorithm. Journal of Chemical Thermodynamics, 43(9), 1323-1330. Lien externe
Goffaux, G., Perrier, M., & Cloutier, M. (août 2011). Cell energy metabolism : a constrained ensemble Kalman filter [Communication écrite]. 18th IFAC World Congress, Milano, Italy. Publié dans IFAC Proceedings Volumes, 44(1). Lien externe
Gould, N. I. M., Orban, D., & Robinson, D. P. (2011). Trajectory-Following Methods for Large-Scale Degenerate Convex Quadratic Programming. (Rapport technique n° G-2011-50). Lien externe
Hertz, A., & Ries, B. (2011). On r-Equitable Colorings of Trees and Forests. (Rapport technique n° G-2011-40). Lien externe
Hertz, A., Uldry, M., & Widmer, M. (2011). Integer Linear Programming Models for a Cement Delivery Problem. (Rapport technique n° G-2011-20). Lien externe
Marcotte, O., Hertz, A., & Schindl, D. (2011). On the Maximum Orders of an Induced Forest, an Induced Tree, and a Stable Set. (Rapport technique n° G-2011-45). Lien externe
Mellah, H., & Sanso, B. (2011). Routers vs Switches, How Much More Power Do They Really Consume? A Datasheet Analysis. (Rapport technique n° G-2011-85). Lien externe
Mhada, F., & Malhamé, R. P. (2011). Approximate performance analysis of CONWIP disciplines in unreliable non homogeneous transfer lines. Annals of Operations Research, 182(1), 213-33. Lien externe
Nourian, M., Caines, P. E., & Malhamé, R. P. (août 2011). Mean Field Analysis of Controlled Cucker-Smale Type Flocking: Linear Analysis and Perturbation Equations . Dans 18th IFAC World Congress, Milano (Italy). Publié dans IFAC Proceedings Volumes, 44(1). Lien externe
Orban, D. (2011). Templating and Automatic Code Generation for Performance with Python. (Rapport technique n° G-2011-30). Lien externe
Ribeiro, G. M., Desaulniers, G., & Desrosiers, J. (2011). A Branch-Price-and-Cut Algorithm for the Workover Rig Routing Problem. (Rapport technique n° G-2011-81). Lien externe
Secci, S., & Sanso, B. (2011). Survivability and reliability of a composite-star transport network with disconnected core switches. Telecommunication Systems, 46(1), 43-59. Lien externe
Stålhane, M., Andersson, H., Christiansen, M., Cordeau, J.-F., & Desaulniers, G. (2011). A Branch-Price-and-Cut Method for a Ship Routing and Scheduling Problem with Split Loads. (Rapport technique n° G-2011-57). Lien externe
Wagneur, E., Cheng, E., & Ng, D. (2011). A closed-form solution for the optimal release times for the F2 vertical bar deteriorating jobs vertical bar Sigma w(j)C(j) problem. Discrete Applied Mathematics, 159(13), 1367-1376. Lien externe
