Isabel Méndez-Díaz

According to our database, Isabel Méndez-Díaz authored at least 33 papers between 2001 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Solving the Traveling Salesman Problem with release dates via branch and cut.

Agustín Montero, Isabel Méndez-Díaz, Juan José Miranda Bront

EURO J. Transp. Logist., 2023

2020

Pickup and delivery problem with incompatibility constraints.

Pablo Factorovich, Isabel Méndez-Díaz, Paula Zabala

Comput. Oper. Res., 2020

An exact algorithm for the edge coloring by total labeling problem.

Fabrizio Borghini, Isabel Méndez-Díaz, Paula Zabala

Ann. Oper. Res., 2020

2019

Analysis of a generalized Linear Ordering Problem via integer programming.

Isabel Méndez-Díaz, Gustavo J. Vulcano, Paula Zabala

Discret. Appl. Math., 2019

2017

Energy-aware scheduling mandatory/optional tasks in multicore real-time systems.

Isabel Méndez-Díaz, Javier Orozco, Rodrigo M. Santos, Paula Zabala

Int. Trans. Oper. Res., 2017

An integer programming approach for the time-dependent traveling salesman problem with time windows.

Agustín Montero, Isabel Méndez-Díaz, Juan José Miranda Bront

Comput. Oper. Res., 2017

An ILP-based local search procedure for the VRP with pickups and deliveries.

Agustín Montero, Juan José Miranda Bront, Isabel Méndez-Díaz

Ann. Oper. Res., 2017

A cluster-first route-second approach for the swap body vehicle routing problem.

Juan José Miranda Bront, Brian Curcio, Isabel Méndez-Díaz, Agustín Montero, Federico Pousa, Paula Zabala

Ann. Oper. Res., 2017

2016

An ILP based heuristic for a generalization of the post-enrollment course timetabling problem.

Isabel Méndez-Díaz, Paula Zabala, Juan José Miranda Bront

Comput. Oper. Res., 2016

New algorithms for composite retrieval.

Esteban Feuerstein, Juan Andres Knebel, Isabel Méndez-Díaz, Amit Stein, Paula Zabala

Proceedings of the XLII Latin American Computing Conference, 2016

2015

A branch-and-price algorithm for the (<i>k, c</i>)-coloring problem.

Enrico Malaguti, Isabel Méndez-Díaz, Juan José Miranda Bront, Paula Zabala

Networks, 2015

A DSATUR-based algorithm for the Equitable Coloring Problem.

Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín

Comput. Oper. Res., 2015

2014

Composite Retrieval of Diverse and Complementary Bundles.

Sihem Amer-Yahia, Francesco Bonchi, Carlos Castillo, Esteban Feuerstein, Isabel Méndez-Díaz, Paula Zabala

IEEE Trans. Knowl. Data Eng., 2014

Facets and valid inequalities for the time-dependent travelling salesman problem.

Juan José Miranda Bront, Isabel Méndez-Díaz, Paula Zabala

Eur. J. Oper. Res., 2014

A polyhedral approach for the equitable coloring problem.

Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín

Discret. Appl. Math., 2014

A Tabu Search Heuristic for the Equitable Coloring Problem.

Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013

An exact DSatur-based algorithm for the Equitable Coloring Problem.

Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín

Electron. Notes Discret. Math., 2013

(k, c) - coloring via Column Generation.

Enrico Malaguti, Isabel Méndez-Díaz, Juan José Miranda Bront, Paula Zabala

Electron. Notes Discret. Math., 2013

A new DSATUR-based algorithm for the Equitable Coloring Problem.

Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín

CoRR, 2013

Complexity and algorithms for composite retrieval.

Sihem Amer-Yahia, Francesco Bonchi, Carlos Castillo, Esteban Feuerstein, Isabel Méndez-Díaz, Paula Zabala

Proceedings of the 22nd International World Wide Web Conference, 2013

A branch-and-cut algorithm for the angular TSP.

Isabel Méndez-Díaz, Federico Pousa, Paula Zabala

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

An IP based heuristic algorithm for the vehicle and crew scheduling pick-up and delivery problem with time windows.

Damián Bakarcic, Gabriela Di Piazza, Isabel Méndez-Díaz, Paula Zabala

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2011

Polyhedral results for the Equitable Coloring Problem.

Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín

Electron. Notes Discret. Math., 2011

Infeasible path formulations for the time-dependent TSP with time windows.

Isabel Méndez-Díaz, Juan José Miranda Bront, Paolo Toth, Paula Zabala

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010

A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem.

Isabel Méndez-Díaz, Juan José Miranda Bront, Gustavo J. Vulcano, Paula Zabala

Electron. Notes Discret. Math., 2010

An integer programming approach for the time-dependent TSP.

Juan José Miranda Bront, Isabel Méndez-Díaz, Paula Zabala

Electron. Notes Discret. Math., 2010

Solving a multicoloring problem with overlaps using integer programming.

Isabel Méndez-Díaz, Paula Zabala

Discret. Appl. Math., 2010

2009

A Column Generation Algorithm for Choice-Based Network Revenue Management.

Juan José Miranda Bront, Isabel Méndez-Díaz, Gustavo J. Vulcano

Oper. Res., 2009

2008

A new formulation for the Traveling Deliveryman Problem.

Isabel Méndez-Díaz, Paula Zabala, Abilio Lucena

Discret. Appl. Math., 2008

A cutting plane algorithm for graph coloring.

Isabel Méndez-Díaz, Paula Zabala

Discret. Appl. Math., 2008

2006

A Branch-and-Cut algorithm for graph coloring.

Isabel Méndez-Díaz, Paula Zabala

Discret. Appl. Math., 2006

2002

Facets of the Graph Coloring Polytope.

Pablo E. Coll, Javier Marenco, Isabel Méndez-Díaz, Paula Zabala

Ann. Oper. Res., 2002

2001

A Polyhedral Approach for Graph Coloring¹.

Isabel Méndez-Díaz, Paula Zabala

Electron. Notes Discret. Math., 2001