| Publication | Date of Publication | Type |
|---|
An exact algorithm for the edge coloring by total labeling problem
Annals of Operations Research | 2020-05-11 | Paper |
Analysis of a generalized linear ordering problem via integer programming
Discrete Applied Mathematics | 2019-11-27 | Paper |
Pickup and delivery problem with incompatibility constraints
Computers \& Operations Research | 2019-11-11 | Paper |
An integer programming approach for the time-dependent traveling salesman problem with time windows
Computers \& Operations Research | 2018-07-12 | Paper |
A branch-and-price algorithm for the (\(k,c\))-coloring problem
Networks | 2018-06-13 | Paper |
An ILP-based local search procedure for the VRP with pickups and deliveries
Annals of Operations Research | 2018-02-15 | Paper |
A cluster-first route-second approach for the swap body vehicle routing problem
Annals of Operations Research | 2018-02-08 | Paper |
An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
Computers \& Operations Research | 2016-11-17 | Paper |
A DSATUR-based algorithm for the equitable coloring problem
Computers \& Operations Research | 2016-11-10 | Paper |
A tabu search heuristic for the equitable coloring problem
Lecture Notes in Computer Science | 2015-10-16 | Paper |
A branch-and-cut algorithm for the latent-class logit assortment problem
Discrete Applied Mathematics | 2015-09-22 | Paper |
Facets and valid inequalities for the time-dependent travelling salesman problem
European Journal of Operational Research | 2015-02-03 | Paper |
A polyhedral approach for the equitable coloring problem
Discrete Applied Mathematics | 2014-05-05 | Paper |
Projective Splitting Algorithms for Integer Linear Programming Part 1: Pure Integer Programs
| 2014-04-15 | Paper |
Polyhedral results for the equitable coloring problem
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
An integer programming approach for the time-dependent TSP
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
A branch-and-cut algorithm for the latent class logit assortment problem
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
A column generation algorithm for choice-based network revenue management
Operations Research | 2011-11-24 | Paper |
Solving a multicoloring problem with overlaps using integer programming
Discrete Applied Mathematics | 2010-05-05 | Paper |
A new formulation for the traveling deliveryman problem
Discrete Applied Mathematics | 2009-03-04 | Paper |
A cutting plane algorithm for graph coloring
Discrete Applied Mathematics | 2008-01-21 | Paper |
A branch-and-cut algorithm for graph coloring
Discrete Applied Mathematics | 2006-04-28 | Paper |
Facets of the graph coloring polytope
Annals of Operations Research | 2003-01-27 | Paper |
A polyhedral approach for graph coloring
| 2001-10-24 | Paper |
