Isabel Méndez-Díaz

Orcid: 0000-0002-3469-1423

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Solving the Traveling Salesman Problem with release dates via branch and cut.
EURO J. Transp. Logist., 2023

2020
Pickup and delivery problem with incompatibility constraints.
Comput. Oper. Res., 2020

An exact algorithm for the edge coloring by total labeling problem.
Ann. Oper. Res., 2020

2019
Analysis of a generalized Linear Ordering Problem via integer programming.
Discret. Appl. Math., 2019

2017
Energy-aware scheduling mandatory/optional tasks in multicore real-time systems.
Int. Trans. Oper. Res., 2017

An integer programming approach for the time-dependent traveling salesman problem with time windows.
Comput. Oper. Res., 2017

An ILP-based local search procedure for the VRP with pickups and deliveries.
Ann. Oper. Res., 2017

A cluster-first route-second approach for the swap body vehicle routing problem.
Ann. Oper. Res., 2017

2016
An ILP based heuristic for a generalization of the post-enrollment course timetabling problem.
Comput. Oper. Res., 2016

New algorithms for composite retrieval.
Proceedings of the XLII Latin American Computing Conference, 2016

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

A DSATUR-based algorithm for the Equitable Coloring Problem.
Comput. Oper. Res., 2015

2014
Composite Retrieval of Diverse and Complementary Bundles.
IEEE Trans. Knowl. Data Eng., 2014

Facets and valid inequalities for the time-dependent travelling salesman problem.
Eur. J. Oper. Res., 2014

A polyhedral approach for the equitable coloring problem.
Discret. Appl. Math., 2014

A branch-and-cut algorithm for the latent-class logit assortment problem.
Discret. Appl. Math., 2014

A Tabu Search Heuristic for the Equitable Coloring Problem.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
An exact DSatur-based algorithm for the Equitable Coloring Problem.
Electron. Notes Discret. Math., 2013

(k, c) - coloring via Column Generation.
Electron. Notes Discret. Math., 2013

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

Complexity and algorithms for composite retrieval.
Proceedings of the 22nd International World Wide Web Conference, 2013

A branch-and-cut algorithm for the angular TSP.
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.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2011
Polyhedral results for the Equitable Coloring Problem.
Electron. Notes Discret. Math., 2011

Infeasible path formulations for the time-dependent TSP with time windows.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010
An integer programming approach for the time-dependent TSP.
Electron. Notes Discret. Math., 2010

Solving a multicoloring problem with overlaps using integer programming.
Discret. Appl. Math., 2010

2009
A Column Generation Algorithm for Choice-Based Network Revenue Management.
Oper. Res., 2009

2008
A new formulation for the Traveling Deliveryman Problem.
Discret. Appl. Math., 2008

A cutting plane algorithm for graph coloring.
Discret. Appl. Math., 2008

2006
A Branch-and-Cut algorithm for graph coloring.
Discret. Appl. Math., 2006

2002
Facets of the Graph Coloring Polytope.
Ann. Oper. Res., 2002

2001
A Polyhedral Approach for Graph Coloring<sup>1</sup>.
Electron. Notes Discret. Math., 2001


  Loading...