Search Results for author: Parisa Zehtabi

Found 7 papers, 0 papers with code

Surrogate Assisted Monte Carlo Tree Search in Combinatorial Optimization

no code implementations14 Mar 2024 Saeid Amiri, Parisa Zehtabi, Danial Dervovic, Michael Cashmore

Industries frequently adjust their facilities network by opening new branches in promising areas and closing branches in areas where they expect low profits.

Combinatorial Optimization

Contrastive Explanations of Centralized Multi-agent Optimization Solutions

no code implementations11 Aug 2023 Parisa Zehtabi, Alberto Pozanco, Ayala Bloch, Daniel Borrajo, Sarit Kraus

We propose CMAoE, a domain-independent approach to obtain contrastive explanations by: (i) generating a new solution $S^\prime$ where property $P$ is enforced, while also minimizing the differences between $S$ and $S^\prime$; and (ii) highlighting the differences between the two solutions, with respect to the features of the objective function of the multi-agent system.

Accelerating Cutting-Plane Algorithms via Reinforcement Learning Surrogates

no code implementations17 Jul 2023 Kyle Mana, Fernando Acero, Stephen Mak, Parisa Zehtabi, Michael Cashmore, Daniele Magazzeni, Manuela Veloso

Discrete optimization belongs to the set of $\mathcal{NP}$-hard problems, spanning fields such as mixed-integer programming and combinatorial optimization.

Combinatorial Optimization Management +2

Explaining Preference-driven Schedules: the EXPRES Framework

no code implementations16 Mar 2022 Alberto Pozanco, Francesca Mosca, Parisa Zehtabi, Daniele Magazzeni, Sarit Kraus

The EXPRES framework consists of: (i) an explanation generator that, based on a Mixed-Integer Linear Programming model, finds the best set of reasons that can explain an unsatisfied preference; and (ii) an explanation parser, which translates the generated explanations into human interpretable ones.

Scheduling

Optimal Admission Control for Multiclass Queues with Time-Varying Arrival Rates via State Abstraction

no code implementations14 Mar 2022 Marc Rigter, Danial Dervovic, Parisa Hassanzadeh, Jason Long, Parisa Zehtabi, Daniele Magazzeni

To improve the scalability of our approach to a greater number of task classes, we present an approximation based on state abstraction.

Towards Efficient Anytime Computation and Execution of Decoupled Robustness Envelopes for Temporal Plans

no code implementations17 Nov 2019 Michael Cashmore, Alessandro Cimatti, Daniele Magazzeni, Andrea Micheli, Parisa Zehtabi

One of the major limitations for the employment of model-based planning and scheduling in practical applications is the need of costly re-planning when an incongruence between the observed reality and the formal model is encountered during execution.

Scheduling

Cannot find the paper you are looking for? You can Submit a new open access paper.