<  Retour au portail Polytechnique Montréal

Documents dont l'auteur est "Carvalho, Margarida"

Monter d'un niveau
Pour citer ou exporter [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Grouper par: Auteurs ou autrices | Date de publication | Sous-type de document | Aucun groupement
Nombre de documents: 19

Article de revue

Perreault-Lafleur, C., Carvalho, M., & Desaulniers, G. (2023). A stochastic integer programming approach to reserve staff scheduling with preferences. International Transactions in Operational Research, 25 pages. Lien externe

Carvalho, M., & Lodi, A. (2023). A theoretical and computational equilibria analysis of a multi-player kidney exchange program. European Journal of Operational Research, 305(1), 373-385. Lien externe

Carvalho, M., Lodi, A., & Pedroso, J. P. (2022). Computing equilibria for integer programming games. European Journal of Operational Research, 303(3), 1057-1070. Lien externe

Baggio, A., Carvalho, M., Lodi, A., & Tramontani, A. (2021). Multilevel Approaches for the Critical Node Problem. Operations Research, 69(2), 486-508. Lien externe

Carvalho, M., Pedroso, J. P., Telha, C., & Van Vyve, M. (2018). Competitive uncapacitated lot-sizing game. International Journal of Production Economics, 204, 148-159. Lien externe

Carvalho, M., Klimentova, X., & Viana, A. (2018). Observability of power systems with optimal PMU placement. Computers & Operations Research, 96, 330-349. Lien externe

Carvalho, M., Lodi, A., & Marcotte, P. (2018). A polynomial algorithm for a continuous bilevel knapsack problem. Operations Research Letters, 46(2), 185-188. Lien externe

Caprara, A., Carvalho, M., Lodi, A., & Woeginger, G. J. (2016). Bilevel knapsack with interdiction constraints. INFORMS Journal on Computing, 28(2), 319-333. Lien externe

Carvalho, M., Lodi, A., Pedroso, J. P., & Viana, A. (2016). Nash equilibria in the two-player kidney exchange game. Mathematical Programming, 161(1-2), 389-417. Lien externe

Caprara, A., Carvalho, M., Lodi, A., & Woeginger, G. J. (2014). A study on the computational complexity of the bilevel knapsack problem. SIAM Journal on Optimization, 24(2), 823-838. Lien externe

Rapport technique

Carvalho, M., Pedroso, J. P., Telha, C., & Van Vyve, M. (2017). Competitive uncapacitated lot-sizing game. (Rapport technique n° DS4DM-2017-008). Lien externe

Carvalho, M., Lodi, A., & Pedroso, J. P. (2017). Existence of Nash equilibria on integer programming games. (Rapport technique n° DS4DM-2017-003). Lien externe

Baggio, A., Carvalho, M., Lodi, A., & Tramontani, A. (2017). Multilevel approaches for the critical node problem. (Rapport technique n° DS4DM-2017-012). Lien externe

Carvalho, M., Lodi, A., & Marcotte, P. (2017). A polynomial algorithm for a continuous bilevel knapsack problem. (Rapport technique n° DS4DM-2017-006). Lien externe

Carvalho, M., Lodi, A., Pedroso, J. P., & Viana, A. (2014). Two-player kidney exchange game. (Rapport technique). Non disponible

Communication écrite

Farnadi, G., St-Arnaud, W., Babaki, B., & Carvalho, M. (février 2021). Individual Fairness in Kidney Exchange Programs [Communication écrite]. 35th AAAI Conference on Artificial Intelligence / 33rd Conference on Innovative Applications of Artificial Intelligence / 11th Symposium on Educational Advances in Artificial Intelligence. Lien externe

Bobbio, F., Carvalho, M., Torrico, A., & Lodi, A. (juillet 2021). Optimal capacity expansion in the college admission [Communication écrite]. 31st European Conference on Operational Research (EURO 2021). Non disponible

Carvalho, M., Lodi, A., & Pedroso, J. P. (juin 2017). Existence of Nash equilibria on integer programming games [Communication écrite]. 18th Congress of the Portuguese Operational Research Society (APDIO), Valença, Portugal. Lien externe

Caprara, A., Carvalho, M., Lodi, A., & Woeginger, G. J. (mars 2013). A complexity and approximability study of the bilevel knapsack problem [Communication écrite]. 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013), Valparaiso, Chile. Lien externe

Liste produite: Thu Dec 26 04:19:03 2024 EST.