Paula Zabala

According to our database1, Paula Zabala authored at least 26 papers between 2001 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

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

Preface to the Best Papers from CLEI 2014 Special Issue.
CLEI Electron. J., 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

Preface to the Best Papers from CLEI 2013 Special Issue.
CLEI Electron. J., 2014

2013
(k, c) - coloring via Column Generation.
Electron. Notes Discret. Math., 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
An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star 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
A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem.
Electron. Notes Discret. Math., 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

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...