Margarida Carvalho

Orcid: 0000-0002-2344-0960

According to our database1, Margarida Carvalho authored at least 39 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Solving Combinatorial Pricing Problems using Embedded Dynamic Programming Models.
CoRR, 2024

Learning to Build Solutions in Stochastic Matching Problems Using Flows (Student Abstract).
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer.
4OR, September, 2023

Managing quality and pricing during a product recall: An analysis of pre-crisis, crisis and post-crisis regimes.
Eur. J. Oper. Res., May, 2023

The selection of an optimal segmentation region in physiological signals.
Int. Trans. Oper. Res., 2023

A theoretical and computational equilibria analysis of a multi-player kidney exchange program.
Eur. J. Oper. Res., 2023

Maximum flow-based formulation for the optimal location of electric vehicle charging stations.
CoRR, 2023

Integer Programming Games: A Gentle Computational Overview.
CoRR, 2023

Optimization of the location and design of urban green spaces.
CoRR, 2023

Diagnosis Model for Detection of e-threats Against Soft-Targets.
Proceedings of the Information Systems and Technologies, 2023

Penalties and Rewards for Fair Learning in Paired Kidney Exchange Programs.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Capacity Planning in Stable Matching: An Application to School Choice.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

OAMIP: Optimizing ANN Architectures Using Mixed-Integer Programming.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2023

2022
Complexity of the multilevel critical node problem.
J. Comput. Syst. Sci., 2022

A Catalog of Formulations for the Network Pricing Problem.
INFORMS J. Comput., 2022

Computing equilibria for integer programming games.
Eur. J. Oper. Res., 2022

Capacity Variation in the Many-to-one Stable Matching.
CoRR, 2022

2021
Multilevel Approaches for the Critical Node Problem.
Oper. Res., 2021

Robust Models for the Kidney Exchange Problem.
INFORMS J. Comput., 2021

ZERO: Playing Mathematical Programming Games.
CoRR, 2021

The Cut and Play Algorithm: Computing Nash Equilibria via Outer Approximations.
CoRR, 2021

Capacity Expansion in the College Admission Problem.
CoRR, 2021

Individual Fairness in Kidney Exchange Programs.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Computing Nash equilibria for integer programming games.
CoRR, 2020

Provable Guarantees for General Two-sided Sequential Matching Markets.
CoRR, 2020

Segmentation and Optimal Region Selection of Physiological Signals using Deep Neural Networks and Combinatorial Optimization.
CoRR, 2020

Identifying Critical Neurons in ANN Architectures using Mixed Integer Programming.
CoRR, 2020

Curriculum learning for multilevel budgeted combinatorial problems.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Pricing and Quality Investments in a Mixed Brown-Green Product Market.
Proceedings of the Computational Logistics - 11th International Conference, 2020

2019
Game theoretical analysis of Kidney Exchange Programs.
CoRR, 2019

Nash Games Among Stackelberg Leaders.
CoRR, 2019

A note on the complexity of integer programming games.
CoRR, 2019

2018
A polynomial algorithm for a continuous bilevel knapsack problem.
Oper. Res. Lett., 2018

Observability of power systems with optimal PMU placement.
Comput. Oper. Res., 2018

2017
Nash equilibria in the two-player kidney exchange game.
Math. Program., 2017

On Kan-injectivity of Locales and Spaces.
Appl. Categorical Struct., 2017

2016
Bilevel Knapsack with Interdiction Constraints.
INFORMS J. Comput., 2016

2014
A Study on the Computational Complexity of the Bilevel Knapsack Problem.
SIAM J. Optim., 2014

2013
A Complexity and Approximability Study of the Bilevel Knapsack Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013


  Loading...