default search action
Margarida Carvalho
Person information
- affiliation: Université de Montréal, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j21]Carl Perreault-Lafleur
, Margarida Carvalho
A stochastic integer programming approach to reserve staff scheduling with preferences. Int. Trans. Oper. Res. 32(1): 289-313 (2025) - 2024
- [j20]Steven Lamontagne, Margarida Carvalho, Ribal Atallah:
Accelerated Benders decomposition and local branching for dynamic maximum covering location problems. Comput. Oper. Res. 167: 106673 (2024) - [j19]Mahdi Rahmoune
A new integrated cooperative game and optimization model for the allocation of forest resources. Eur. J. Oper. Res. 316(1): 329-340 (2024) - [j18]Margarida Carvalho
When Nash Meets Stackelberg. Manag. Sci. 70(10): 7308-7324 (2024) - [j17]Quang Minh Bui
Asymmetry in the complexity of the multi-commodity network pricing problem. Math. Program. 208(1): 425-461 (2024) - [c9]William St-Arnaud, Margarida Carvalho, Golnoosh Farnadi
Learning to Build Solutions in Stochastic Matching Problems Using Flows (Student Abstract). AAAI 2024: 23659-23660 - [i21]Quang Minh Bui
Solving Combinatorial Pricing Problems using Embedded Dynamic Programming Models. CoRR abs/2403.12923 (2024) - [i20]Alberto Boggio Tomasaz, Margarida Carvalho, Roberto Cordone, Pierre Hosteins:
On the completeness of several fortification-interdiction games in the Polynomial Hierarchy. CoRR abs/2406.01756 (2024) - [i19]Ignacio Rios, Federico Bobbio, Margarida Carvalho, Alfredo Torrico:
Stable Matching with Contingent Priorities. CoRR abs/2409.04914 (2024) - 2023
- [j16]Manuel V. C. Vieira
Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer. 4OR 21(3): 491-512 (2023) - [j15]Margarida Carvalho
A theoretical and computational equilibria analysis of a multi-player kidney exchange program. Eur. J. Oper. Res. 305(1): 373-385 (2023) - [j14]Arka Mukherjee
Managing quality and pricing during a product recall: An analysis of pre-crisis, crisis and post-crisis regimes. Eur. J. Oper. Res. 307(1): 406-420 (2023) - [j13]Steven Lamontagne, Margarida Carvalho, Emma Frejinger
Optimising Electric Vehicle Charging Station Placement Using Advanced Discrete Choice Models. INFORMS J. Comput. 35(5): 1195-1213 (2023) - [j12]Jorge Oliveira
The selection of an optimal segmentation region in physiological signals. Int. Trans. Oper. Res. 30(1): 601-618 (2023) - [c8]Mostafa ElAraby, Guy Wolf, Margarida Carvalho:
OAMIP: Optimizing ANN Architectures Using Mixed-Integer Programming. CPAIOR 2023: 219-237 - [c7]Federico Bobbio
Capacity Planning in Stable Matching: An Application to School Choice. EC 2023: 295 - [c6]Margarida Carvalho, Alison Caulfield, Yi Lin, Adrian Vetta:
Penalties and Rewards for Fair Learning in Paired Kidney Exchange Programs. WINE 2023: 130-150 - [c5]Sónia M. A. Morgado
Diagnosis Model for Detection of e-threats Against Soft-Targets. WorldCIST (2) 2023: 249-262 - [i18]Caroline Leboeuf, Margarida Carvalho, Yan Kestens
Optimization of the location and design of urban green spaces. CoRR abs/2303.07202 (2023) - [i17]Margarida Carvalho, Gabriele Dragotto, Andrea Lodi, Sriram Sankaranarayanan:
Integer Programming Games: A Gentle Computational Overview. CoRR abs/2306.02817 (2023) - [i16]Margarida Carvalho, Alison Caulfield, Yi Lin, Adrian Vetta:
Penalties and Rewards for Fair Learning in Paired Kidney Exchange Programs. CoRR abs/2309.13421 (2023) - [i15]Pierre-Luc Parent, Margarida Carvalho, Miguel F. Anjos, Ribal Atallah:
Maximum flow-based formulation for the optimal location of electric vehicle charging stations. CoRR abs/2312.05980 (2023) - 2022
- [j11]Margarida Carvalho
Computing equilibria for integer programming games. Eur. J. Oper. Res. 303(3): 1057-1070 (2022) - [j10]Quang Minh Bui
A Catalog of Formulations for the Network Pricing Problem. INFORMS J. Comput. 34(5): 2658-2674 (2022) - [j9]Adel Nabli
Complexity of the multilevel critical node problem. J. Comput. Syst. Sci. 127: 122-145 (2022) - [i14]Federico Bobbio, Margarida Carvalho, Andrea Lodi, Alfredo Torrico:
Capacity Variation in the Many-to-one Stable Matching. CoRR abs/2205.01302 (2022) - 2021
- [j8]Margarida Carvalho
Robust Models for the Kidney Exchange Problem. INFORMS J. Comput. 33(3): 861-881 (2021) - [j7]Andrea Baggio, Margarida Carvalho
Multilevel Approaches for the Critical Node Problem. Oper. Res. 69(2): 486-508 (2021) - [c4]Golnoosh Farnadi, William St-Arnaud, Behrouz Babaki, Margarida Carvalho:
Individual Fairness in Kidney Exchange Programs. AAAI 2021: 11496-11505 - [i13]Quang Minh Bui, Bernard Gendron, Margarida Carvalho:
A Catalog of Formulations for the Network Pricing Problem. CoRR abs/2106.03887 (2021) - [i12]Federico Bobbio, Margarida Carvalho, Andrea Lodi, Alfredo Torrico:
Capacity Expansion in the College Admission Problem. CoRR abs/2110.00734 (2021) - [i11]Margarida Carvalho, Gabriele Dragotto
The Cut and Play Algorithm: Computing Nash Equilibria via Outer Approximations. CoRR abs/2111.05726 (2021) - [i10]Gabriele Dragotto, Sriram Sankaranarayanan, Margarida Carvalho, Andrea Lodi:
ZERO: Playing Mathematical Programming Games. CoRR abs/2111.07932 (2021) - 2020
- [c3]Arka Mukherjee
Pricing and Quality Investments in a Mixed Brown-Green Product Market. ICCL 2020: 715-732 - [c2]Adel Nabli, Margarida Carvalho:
Curriculum learning for multilevel budgeted combinatorial problems. NeurIPS 2020 - [i9]Mostafa ElAraby
Identifying Critical Neurons in ANN Architectures using Mixed Integer Programming. CoRR abs/2002.07259 (2020) - [i8]Jorge Oliveira, Margarida Carvalho, Diogo Marcelo Nogueira, Miguel T. Coimbra:
Segmentation and Optimal Region Selection of Physiological Signals using Deep Neural Networks and Combinatorial Optimization. CoRR abs/2003.07981 (2020) - [i7]Alfredo Torrico, Margarida Carvalho, Andrea Lodi:
Provable Guarantees for General Two-sided Sequential Matching Markets. CoRR abs/2006.04313 (2020) - [i6]Adel Nabli, Margarida Carvalho, Pierre Hosteins:
Complexity of the Multilevel Critical Node Problem. CoRR abs/2007.02370 (2020) - [i5]Adel Nabli, Margarida Carvalho:
Curriculum learning for multilevel budgeted combinatorial problems. CoRR abs/2007.03151 (2020) - [i4]Margarida Carvalho, Andrea Lodi, João Pedro Pedroso:
Computing Nash equilibria for integer programming games. CoRR abs/2012.07082 (2020)
2010 – 2019
- 2019
- [i3]Margarida Carvalho:
A note on the complexity of integer programming games. CoRR abs/1907.11338 (2019) - [i2]Margarida Carvalho, Gabriele Dragotto
Nash Games Among Stackelberg Leaders. CoRR abs/1910.06452 (2019) - [i1]Margarida Carvalho, Andrea Lodi:
Game theoretical analysis of Kidney Exchange Programs. CoRR abs/1911.09207 (2019) - 2018
- [j6]Margarida Carvalho
Observability of power systems with optimal PMU placement. Comput. Oper. Res. 96: 330-349 (2018) - [j5]Margarida Carvalho
A polynomial algorithm for a continuous bilevel knapsack problem. Oper. Res. Lett. 46(2): 185-188 (2018) - 2017
- [j4]Margarida Carvalho, Lurdes Sousa
On Kan-injectivity of Locales and Spaces. Appl. Categorical Struct. 25(1): 83-104 (2017) - [j3]Margarida Carvalho, Andrea Lodi, João Pedro Pedroso
Nash equilibria in the two-player kidney exchange game. Math. Program. 161(1-2): 389-417 (2017) - 2016
- [j2]Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger:
Bilevel Knapsack with Interdiction Constraints. INFORMS J. Comput. 28(2): 319-333 (2016) - 2014
- [j1]Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger:
A Study on the Computational Complexity of the Bilevel Knapsack Problem. SIAM J. Optim. 24(2): 823-838 (2014) - 2013
- [c1]Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger:
A Complexity and Approximability Study of the Bilevel Knapsack Problem. IPCO 2013: 98-109
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: