default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIsabel Méndez-Díaz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j27]Agustín Montero, Isabel Méndez-Díaz
, Juan José Miranda Bront:
Solving the Traveling Salesman Problem with release dates via branch and cut. EURO J. Transp. Logist. 12: 100121 (2023)- 2020
- [j26]Fabrizio Borghini, Isabel Méndez-Díaz, Paula Zabala:
An exact algorithm for the edge coloring by total labeling problem. Ann. Oper. Res. 286(1): 11-31 (2020) - [j25]Pablo Factorovich, Isabel Méndez-Díaz, Paula Zabala:
Pickup and delivery problem with incompatibility constraints. Comput. Oper. Res. 113 (2020)
2010 – 2019
- 2019
- [j24]Isabel Méndez-Díaz, Gustavo J. Vulcano, Paula Zabala:
Analysis of a generalized Linear Ordering Problem via integer programming. Discret. Appl. Math. 271: 93-107 (2019) - 2017
- [j23]Juan José Miranda Bront, Brian Curcio, Isabel Méndez-Díaz, Agustín Montero, Federico Pousa, Paula Zabala:
A cluster-first route-second approach for the swap body vehicle routing problem. Ann. Oper. Res. 253(2): 935-956 (2017) - [j22]Agustín Montero, Juan José Miranda Bront, Isabel Méndez-Díaz:
An ILP-based local search procedure for the VRP with pickups and deliveries. Ann. Oper. Res. 259(1-2): 327-350 (2017) - [j21]Agustín Montero, Isabel Méndez-Díaz, Juan José Miranda Bront:
An integer programming approach for the time-dependent traveling salesman problem with time windows. Comput. Oper. Res. 88: 280-289 (2017) - [j20]Isabel Méndez-Díaz, Javier Orozco, Rodrigo M. Santos, Paula Zabala:
Energy-aware scheduling mandatory/optional tasks in multicore real-time systems. Int. Trans. Oper. Res. 24(1-2): 173-198 (2017) - 2016
- [j19]Isabel Méndez-Díaz, Paula Zabala, Juan José Miranda Bront:
An ILP based heuristic for a generalization of the post-enrollment course timetabling problem. Comput. Oper. Res. 76: 195-207 (2016) - [c5]Esteban Feuerstein, Juan Andres Knebel, Isabel Méndez-Díaz, Amit Stein, Paula Zabala:
New algorithms for composite retrieval. CLEI 2016: 1-9 - 2015
- [j18]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
A DSATUR-based algorithm for the Equitable Coloring Problem. Comput. Oper. Res. 57: 41-50 (2015) - [j17]Enrico Malaguti, Isabel Méndez-Díaz, Juan José Miranda Bront, Paula Zabala:
A branch-and-price algorithm for the (k, c)-coloring problem. Networks 65(4): 353-366 (2015) - 2014
- [j16]Isabel Méndez-Díaz, Juan José Miranda Bront, Gustavo J. Vulcano, Paula Zabala:
A branch-and-cut algorithm for the latent-class logit assortment problem. Discret. Appl. Math. 164: 246-263 (2014) - [j15]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
A polyhedral approach for the equitable coloring problem. Discret. Appl. Math. 164: 413-426 (2014) - [j14]Juan José Miranda Bront, Isabel Méndez-Díaz, Paula Zabala:
Facets and valid inequalities for the time-dependent travelling salesman problem. Eur. J. Oper. Res. 236(3): 891-902 (2014) - [j13]Sihem Amer-Yahia, Francesco Bonchi, Carlos Castillo, Esteban Feuerstein, Isabel Méndez-Díaz, Paula Zabala:
Composite Retrieval of Diverse and Complementary Bundles. IEEE Trans. Knowl. Data Eng. 26(11): 2662-2675 (2014) - [c4]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
A Tabu Search Heuristic for the Equitable Coloring Problem. ISCO 2014: 347-358 - [i7]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
An exact DSatur-based algorithm for the Equitable Coloring Problem. CoRR abs/1405.7011 (2014) - [i6]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
A tabu search heuristic for the Equitable Coloring Problem. CoRR abs/1405.7020 (2014) - 2013
- [j12]Enrico Malaguti, Isabel Méndez-Díaz, Juan José Miranda Bront, Paula Zabala:
(k, c) - coloring via Column Generation. Electron. Notes Discret. Math. 41: 447-454 (2013) - [j11]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
An exact DSatur-based algorithm for the Equitable Coloring Problem. Electron. Notes Discret. Math. 44: 281-286 (2013) - [c3]Sihem Amer-Yahia, Francesco Bonchi, Carlos Castillo, Esteban Feuerstein, Isabel Méndez-Díaz, Paula Zabala:
Complexity and algorithms for composite retrieval. WWW (Companion Volume) 2013: 79-80 - [i5]Damián Bakarcic, Gabriela Di Piazza, Isabel Méndez-Díaz, Paula Zabala:
An IP based heuristic algorithm for the vehicle and crew scheduling pick-up and delivery problem with time windows. CTW 2013: 19-22 - [i4]Isabel Méndez-Díaz, Federico Pousa, Paula Zabala:
A branch-and-cut algorithm for the angular TSP. CTW 2013: 175-178 - [i3]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
A new DSATUR-based algorithm for the Equitable Coloring Problem. CoRR abs/1306.1758 (2013) - 2011
- [j10]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
Polyhedral results for the Equitable Coloring Problem. Electron. Notes Discret. Math. 37: 159-164 (2011) - [c2]Pablo Factorovich, Isabel Méndez-Díaz, Paula Zabala:
The Pickup and Delivery Problem with Incompatibility Constraints. CTW 2011: 150-153 - [c1]Isabel Méndez-Díaz, Juan José Miranda Bront, Paolo Toth, Paula Zabala:
Infeasible path formulations for the time-dependent TSP with time windows. CTW 2011: 198-202 - [i2]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
A polyhedral approach for the Equitable Coloring Problem. CoRR abs/1106.3348 (2011) - [i1]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
Polyhedral results for the Equitable Coloring Problem. CoRR abs/1106.3349 (2011) - 2010
- [j9]Isabel Méndez-Díaz, Paula Zabala:
Solving a multicoloring problem with overlaps using integer programming. Discret. Appl. Math. 158(4): 349-354 (2010) - [j8]Juan José Miranda Bront, Isabel Méndez-Díaz, Paula Zabala:
An integer programming approach for the time-dependent TSP. Electron. Notes Discret. Math. 36: 351-358 (2010) - [j7]Isabel Méndez-Díaz, Juan José Miranda Bront, Gustavo J. Vulcano, Paula Zabala:
A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem. Electron. Notes Discret. Math. 36: 383-390 (2010)
2000 – 2009
- 2009
- [j6]Juan José Miranda Bront, Isabel Méndez-Díaz, Gustavo J. Vulcano:
A Column Generation Algorithm for Choice-Based Network Revenue Management. Oper. Res. 57(3): 769-784 (2009) - 2008
- [j5]Isabel Méndez-Díaz, Paula Zabala:
A cutting plane algorithm for graph coloring. Discret. Appl. Math. 156(2): 159-179 (2008) - [j4]Isabel Méndez-Díaz, Paula Zabala, Abilio Lucena:
A new formulation for the Traveling Deliveryman Problem. Discret. Appl. Math. 156(17): 3223-3237 (2008) - 2006
- [j3]Isabel Méndez-Díaz, Paula Zabala:
A Branch-and-Cut algorithm for graph coloring. Discret. Appl. Math. 154(5): 826-847 (2006) - 2002
- [j2]Pablo E. Coll, Javier Marenco, Isabel Méndez-Díaz, Paula Zabala:
Facets of the Graph Coloring Polytope. Ann. Oper. Res. 116(1-4): 79-90 (2002) - 2001
- [j1]Isabel Méndez-Díaz, Paula Zabala:
A Polyhedral Approach for Graph Coloring1. Electron. Notes Discret. Math. 7: 178-181 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
