Isabel Méndez-Díaz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Isabel Méndez-Díaz has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Paula Zabala
DC‐FCEN UBA ICC UBA‐CONCIET Int. Güiraldes y Av. Cantilo Buenos Aires 1428 Argentina
8 shared publications - Graciela Nasini
FCEIA Universidad Nacional de Rosario Rosario Argentina
6 shared publications - Juan José Miranda-Bront
Departamento de Computación, FCEyN, Universidad de Buenos Aires, Ciudad Autónoma de Buenos Aires, Argentina
6 shared publications - Daniel Severín
Depto. de Matemática (FCEIA) Universidad Nacional de Rosario Argentina
4 shared publications - Agustín Montero
Departamento de Computación, FCEyN, Universidad de Buenos Aires, Ciudad Autónoma de Buenos Aires, Argentina
2 shared publications Agustín Montero
1 shared publication
Latest Publications
- Open Access
- 20 November 2023
- Published by Elsevier in EURO Journal on Transportation and Logistics
- Vol. 12
Solving the Traveling Salesman Problem with release dates via branch and cut
- 20 November 2023
- Published by Elsevier in EURO Journal on Transportation and Logistics
- Vol. 12
Open AccessSolving the Traveling Salesman Problem with release dates via branch and cut
- 1 January 2020
- Published by Elsevier in Computers & Operations Research
- Vol. 113
Pickup and delivery problem with incompatibility constraints
- 1 January 2020
- Published by Elsevier in Computers & Operations Research
- Vol. 113
Pickup and delivery problem with incompatibility constraints
- 25 July 2018
- Published by Springer Nature in Annals of Operations Research
- Vol. 286 (1-2) , 11-31
An exact algorithm for the edge coloring by total labeling problem
- 25 July 2018
- Published by Springer Nature in Annals of Operations Research
- Vol. 286 (1-2) , 11-31
An exact algorithm for the edge coloring by total labeling problem
- 15 May 2017
- Published by Springer Nature in Annals of Operations Research
- Vol. 259 (1-2) , 327-350
An ILP-based local search procedure for the VRP with pickups and deliveries
- 15 May 2017
- Published by Springer Nature in Annals of Operations Research
- Vol. 259 (1-2) , 327-350
An ILP-based local search procedure for the VRP with pickups and deliveries
- 1 December 2016
- Published by Elsevier in Computers & Operations Research
- Vol. 76, 195-207
An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
- 1 December 2016
- Published by Elsevier in Computers & Operations Research
- Vol. 76, 195-207
An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
- 8 August 2016
- Published by Wiley in International Transactions in Operational Research
- Vol. 24 (1-2) , 173-198
Energy‐aware scheduling mandatory/optional tasks in multicore real‐time systems
Reward‐based scheduling of real‐time systems of periodic, preemptable, and independent tasks with mandatory and optional parts in homogeneous multiprocessors with energy considerations is a problem that has not been analyzed before. The problem is NP‐hard. In this paper, a restricted migration schedule is adopted in which different jobs of the same task may execute in different processors and at different power modes but no migration is allowed after the job has started its execution. An objective function to maximize the performance of the system considering the execution of optional parts, the benefits of slowing down the processor, and a penalty for changing the operation frequency is introduced together with a set of constraints that guarantee the real‐time performance of the system. Different algorithms are proposed to find a feasible schedule maximizing the objective function and are compared using synthetic systems of tasks generated following guidelines proposed in previous papers.
- 8 August 2016
- Published by Wiley in International Transactions in Operational Research
- Vol. 24 (1-2) , 173-198
Energy‐aware scheduling mandatory/optional tasks in multicore real‐time systems
Reward‐based scheduling of real‐time systems of periodic, preemptable, and independent tasks with mandatory and optional parts in homogeneous multiprocessors with energy considerations is a problem that has not been analyzed before. The problem is NP‐hard. In this paper, a restricted migration schedule is adopted in which different jobs of the same task may execute in different processors and at different power modes but no migration is allowed after the job has started its execution. An objective function to maximize the performance of the system considering the execution of optional parts, the benefits of slowing down the processor, and a penalty for changing the operation frequency is introduced together with a set of constraints that guarantee the real‐time performance of the system. Different algorithms are proposed to find a feasible schedule maximizing the objective function and are compared using synthetic systems of tasks generated following guidelines proposed in previous papers.
- 28 May 2016
- Published by Springer Nature in Annals of Operations Research
- Vol. 253 (2) , 935-956
A cluster-first route-second approach for the swap body vehicle routing problem
- 28 May 2016
- Published by Springer Nature in Annals of Operations Research
- Vol. 253 (2) , 935-956
A cluster-first route-second approach for the swap body vehicle routing problem
- 1 August 2014
- Published by Elsevier in European Journal of Operational Research
- Vol. 236 (3) , 891-902
Facets and valid inequalities for the time-dependent travelling salesman problem
- 1 August 2014
- Published by Elsevier in European Journal of Operational Research
- Vol. 236 (3) , 891-902
Facets and valid inequalities for the time-dependent travelling salesman problem
- Open Access
A tabu search heuristic for the Equitable Coloring Problem
The Equitable Coloring Problem is a variant of the Graph Coloring Problem where the sizes of two arbitrary color classes differ in at most one unit. This additional condition, called equity constraints, arises naturally in several applications. Due to the hardness of the problem, current exact algorithms can not solve large-sized instances. Such instances must be addressed only via heuristic methods. In this paper we present a tabu search heuristic for the Equitable Coloring Problem. This algorithm is an adaptation of the dynamic TabuCol version of Galinier and Hao. In order to satisfy equity constraints, new local search criteria are given. Computational experiments are carried out in order to find the best combination of parameters involved in the dynamic tenure of the heuristic. Finally, we show the good performance of our heuristic over known benchmark instances.
Open AccessA tabu search heuristic for the Equitable Coloring Problem
The Equitable Coloring Problem is a variant of the Graph Coloring Problem where the sizes of two arbitrary color classes differ in at most one unit. This additional condition, called equity constraints, arises naturally in several applications. Due to the hardness of the problem, current exact algorithms can not solve large-sized instances. Such instances must be addressed only via heuristic methods. In this paper we present a tabu search heuristic for the Equitable Coloring Problem. This algorithm is an adaptation of the dynamic TabuCol version of Galinier and Hao. In order to satisfy equity constraints, new local search criteria are given. Computational experiments are carried out in order to find the best combination of parameters involved in the dynamic tenure of the heuristic. Finally, we show the good performance of our heuristic over known benchmark instances.
- Open Access
An exact DSatur-based algorithm for the Equitable Coloring Problem
This paper describes an exact algorithm for the Equitable Coloring Problem, based on the well known DSatur algorithm for the classic Coloring Problem with new pruning rules specifically derived from the equity constraint. Computational experiences show that our algorithm is competitive with those known in literature.
Open AccessAn exact DSatur-based algorithm for the Equitable Coloring Problem
This paper describes an exact algorithm for the Equitable Coloring Problem, based on the well known DSatur algorithm for the classic Coloring Problem with new pruning rules specifically derived from the equity constraint. Computational experiences show that our algorithm is competitive with those known in literature.