INVESTIGADORES
ZABALA Paula Lorena
artículos
MICHELETTO, MATIAS; ZABALA, PAULA; OCHOA, SERGIO F.; MESEGUER, ROC; SANTOS, RODRIGO
Determining Real-Time Communication Feasibility in IoT Systems Supported by LoRaWAN
SENSORS; Año: 2023 vol. 23
MOYANO, MAURICIO; ZABALA, PAULA; GATICA, GUSTAVO; CABRERA-GUERRERO, GUILLERMO
Local search algorithms for the composite retrieval problem
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH; Año: 2023 vol. 30 p. 1065 - 1091
LUCCI, MAURO; SEVERÍN, DANIEL; ZABALA, PAULA
A metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH; Año: 2023 vol. 30 p. 970 - 1001
FRAGA, MARTIN; MICHELETTO, MATÍAS; LLINÁS, ANDRÉS; SANTOS, RODRIGO; ZABALA, PAULA
Flow Scheduling in Data Center Networks with Time and Energy Constraints: A Software-Defined Network Approach
Future Internet; Año: 2022 vol. 14
BORGHINI, FABRIZIO; MÉNDEZ-DÍAZ, ISABEL; ZABALA, PAULA
An exact algorithm for the edge coloring by total labeling problem
ANNALS OF OPERATIONS RESEARCH; Año: 2020 vol. 286 p. 11 - 31
FACTOROVICH, PABLO; MÉNDEZ-DÍAZ, ISABEL; ZABALA, PAULA
Pickup and delivery problem with incompatibility constraints
COMPUTERS & OPERATIONS RESEARCH; Año: 2020 vol. 113
MÉNDEZ-DÍAZ, ISABEL; VULCANO, GUSTAVO; ZABALA, PAULA
Analysis of a generalized Linear Ordering Problem via integer programming
DISCRETE APPLIED MATHEMATICS; Año: 2019 vol. 271 p. 93 - 107
ISABEL MÉNDEZ-DÍAZ; JAVIER OROZCO; RODRIGO SANTOS; PAULA ZABALA
Energy Aware Scheduling Mandatory/Optional tasks in Multicore Real-Time Systems
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH; Lugar: Hobken, New Jersey; Año: 2017 vol. 24 p. 173 - 198
JUAN 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
ANNALS OF OPERATIONS RESEARCH; Lugar: Berlin; Año: 2017 vol. 253 p. 935 - 956
ISABEL MÉNDEZ-DÍAZ; JUAN MIRANDA-BRONT; PAULA ZABALA
An ILPbased heuristic for a generalization of the post-enrollment course timetabling problem
COMPUTERS & OPERATIONS RESEARCH; Lugar: Amsterdam; Año: 2016 vol. 76 p. 195 - 207
ENRICO MALAGUTI; ISABEL MÉNDEZ-DÍAZ; JUAN MIRANDA-BRONT; PAULA ZABALA
A Branch-and-Price algorithm for the (k; c)-coloring problem
NETWORKS; Lugar: Hoboken; Año: 2015 vol. 65 p. 353 - 366
ISABEL MÉNDEZ-DÍAZ; JUAN MIRANDA-BRONT; GUSTAVO VULCANO; PAULA ZABALA
A Branch-and-Cut Algorithm for the Latent-Class Logit Assortment Problem
DISCRETE APPLIED MATHEMATICS; Año: 2014 vol. 164 p. 246 - 263
SIHEM AMER-YAHIA; FRANCESCO BONCHI; CARLOS CASTILLO; ESTEBAN FEUERSTEIN; ISABEL MÉNDEZ-DÍAZ; PAULA ZABALA
Composite Retrieval of Diverse and Complementary Bundles
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING; Lugar: Los Alamitos, CA, USA; Año: 2014 vol. 26 p. 2662 - 2675
JUAN MIRANDA-BRONT; ISABEL MÉNDEZ-DÍAZ; PAULA ZABALA
Facets and valid inequalities for the time-dependent travelling salesman problem
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH; Lugar: Amsterdam; Año: 2014 vol. 236 p. 891 - 902
ENRICO MALAGUTI; ISABEL MÉNDEZ-DÍAZ; JUAN MIRANDA-BRONT; PAULA ZABALA
(k, c)-coloring via Column Generation
Electronic Notes in Discrete Mathematics; Lugar: Amsterdam; Año: 2013 vol. 41 p. 447 - 454
HERNÁN BERINSKI; PAULA ZABALA
An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem
Electronic Notes in Discrete Mathematics; Lugar: Amsterdam; Año: 2011 vol. 37 p. 273 - 278
ISABEL MÉNDEZ-DÍAZ; PAULA ZABALA
Solving a multicoloring problem with overlaps using integer programming
DISCRETE APPLIED MATHEMATICS; Año: 2010 vol. 158 p. 349 - 354
JUAN MIRANDA-BRONT; ISABEL MÉNDEZ-DÍAZ; PAULA ZABALA
An integer programming approach for the time-dependent TSP
Electronic Notes in Discrete Mathematics; Lugar: Amsterdam; Año: 2010 vol. 36 p. 351 - 358
MÉNDEZ-DÍAZ, ISABEL; MIRANDA-BRONT, JUAN JOSÉ; VULCANO, GUSTAVO; ZABALA, PAULA
A branch-and-cut algorithm for the latent class logit assortment problem
Electronic Notes in Discrete Mathematics; Año: 2010 vol. 36 p. 383 - 390
MÉNDEZ-DÍAZ, ISABEL; ZABALA, PAULA
A cutting plane algorithm for graph coloring
DISCRETE APPLIED MATHEMATICS; Lugar: Amsterdam; Año: 2008 vol. 156 p. 159 - 179
ISABEL MÉNDEZ-DÍAZ; PAULA ZABALA; ABILIO LUCENA
A new formulation to the Traveling Deliveryman Problem
DISCRETE APPLIED MATHEMATICS; Lugar: Amsterdam; Año: 2008 vol. 156 p. 3223 - 3237
MÉNDEZ-DÍAZ, ISABEL; ZABALA, PAULA
A Branch-and-Cut for Graph Coloring
DISCRETE APPLIED MATHEMATICS; Lugar: Amsterdam; Año: 2006 vol. 154 p. 826 - 847
COLL, PABLO; MARENCO, JAVIER; MÉNDEZ-DÍAZ, ISABEL; ZABALA, PAULA
Facets of the graph colorign
ANNALS OF OPERATIONS RESEARCH; Lugar: New York; Año: 2002 vol. 116 p. 79 - 90
MÉNDEZ-DÍAZ, ISABEL; ZABALA, PAULA
A polyhedral approach for graph coloring
Electronic Notes in Discrete Mathematics; Lugar: Amsterdam; Año: 2001 vol. 7 p. 178 - 181
MÉNDEZ-DÍAZ, ISABEL; ZABALA, PAULA
A generalization of the coloring graph problem
INVESTIGACION OPERATIVA; Lugar: Río de Janeiro; Año: 1999 vol. 8 p. 167 - 184