default search action
Paula Zabala
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j27]Paula Zabala, Kelly Pernett:
Preface to the CLEI 2022 Special Issue. CLEI Electron. J. 26(2) (2023) - [j26]Mauro Lucci, Daniel E. Severín, Paula Zabala
:
A metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows. Int. Trans. Oper. Res. 30(2): 970-1001 (2023) - [j25]Mauricio Moyano
Local search algorithms for the composite retrieval problem. Int. Trans. Oper. Res. 30(2): 1065-1091 (2023) - [j24]Matias J. Micheletto, Paula Zabala
Determining Real-Time Communication Feasibility in IoT Systems Supported by LoRaWAN. Sensors 23(9): 4281 (2023) - 2022
- [j23]Martin Fraga, Matias J. Micheletto
Flow Scheduling in Data Center Networks with Time and Energy Constraints: A Software-Defined Network Approach. Future Internet 14(2): 65 (2022) - 2021
- [i3]Mauro Lucci, Daniel Severín, Paula Zabala:
A metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows. CoRR abs/2102.01780 (2021) - 2020
- [j22]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) - [j21]Pablo Factorovich, Isabel Méndez-Díaz
Pickup and delivery problem with incompatibility constraints. Comput. Oper. Res. 113 (2020)
2010 – 2019
- 2019
- [j20]Isabel Méndez-Díaz, Gustavo J. Vulcano
Analysis of a generalized Linear Ordering Problem via integer programming. Discret. Appl. Math. 271: 93-107 (2019) - 2017
- [j19]Juan José Miranda Bront
A cluster-first route-second approach for the swap body vehicle routing problem. Ann. Oper. Res. 253(2): 935-956 (2017) - [j18]Isabel Méndez-Díaz, Javier Orozco, Rodrigo M. Santos
Energy-aware scheduling mandatory/optional tasks in multicore real-time systems. Int. Trans. Oper. Res. 24(1-2): 173-198 (2017) - 2016
- [j17]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) - [c4]Esteban Feuerstein, Juan Andres Knebel, Isabel Méndez-Díaz, Amit Stein, Paula Zabala:
New algorithms for composite retrieval. CLEI 2016: 1-9 - 2015
- [j16]José Aguilar, Hernán Astudillo
Preface to the Best Papers from CLEI 2014 Special Issue. CLEI Electron. J. 18(2) (2015) - [j15]Enrico Malaguti, Isabel Méndez-Díaz, Juan José Miranda Bront
A branch-and-price algorithm for the (k, c)-coloring problem. Networks 65(4): 353-366 (2015) - 2014
- [j14]José Aguilar, Jaelson Castro, Sergio España, Alexandra La Cruz, María E. Villapol, Paula Zabala:
Preface to the Best Papers from CLEI 2013 Special Issue. CLEI Electron. J. 17(2) (2014) - [j13]Isabel Méndez-Díaz, Juan José Miranda Bront
A branch-and-cut algorithm for the latent-class logit assortment problem. Discret. Appl. Math. 164: 246-263 (2014) - [j12]Juan José Miranda Bront
Facets and valid inequalities for the time-dependent travelling salesman problem. Eur. J. Oper. Res. 236(3): 891-902 (2014) - [j11]Sihem Amer-Yahia, Francesco Bonchi, Carlos Castillo
Composite Retrieval of Diverse and Complementary Bundles. IEEE Trans. Knowl. Data Eng. 26(11): 2662-2675 (2014) - 2013
- [j10]Enrico Malaguti, Isabel Méndez-Díaz, Juan José Miranda Bront
(k, c) - coloring via Column Generation. Electron. Notes Discret. Math. 41: 447-454 (2013) - [c3]Sihem Amer-Yahia, Francesco Bonchi, Carlos Castillo
Complexity and algorithms for composite retrieval. WWW (Companion Volume) 2013: 79-80 - [i2]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 - [i1]Isabel Méndez-Díaz, Federico Pousa, Paula Zabala:
A branch-and-cut algorithm for the angular TSP. CTW 2013: 175-178 - 2011
- [j9]Hernán Berinsky, Paula Zabala:
An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem. Electron. Notes Discret. Math. 37: 273-278 (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 - 2010
- [j8]Isabel Méndez-Díaz, Paula Zabala:
Solving a multicoloring problem with overlaps using integer programming. Discret. Appl. Math. 158(4): 349-354 (2010) - [j7]Juan José Miranda Bront
An integer programming approach for the time-dependent TSP. Electron. Notes Discret. Math. 36: 351-358 (2010) - [j6]Isabel Méndez-Díaz, Juan José Miranda Bront
A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem. Electron. Notes Discret. Math. 36: 383-390 (2010)
2000 – 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-07-05 21:07 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: