• Regular pattern-free coloring 

  Escamocher, Guillaume; O'Sullivan, Barry (Elsevier, 2022-11-15)

  We study the graph coloring problem under two kinds of simultaneous restrictions. First we forbid some patterns to appear in the graph, where a pattern is a small subgraph. Second we only consider regular graphs, meaning ...
• MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem 

  Balough, Andrea; Garraffa, Michele; O'Sullivan, Barry; Salassa, Fabio (Elsevier, 2022-05-17)

  We consider the No-idle Permutation Flowshop Scheduling Problem (NPFSP) with a total tardiness criterion. We present two Mixed Integer Linear Programming (MILP) formulations based on positional and precedence variables, ...
• Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem 

  Fajemisin, Adejuyigbe O.; Prestwich, Steven D.; Climent, Laura (Springer, 2022-01)

  Sustainable forest management is concerned with the management of forests according to the principles of sustainable development. As a contribution to the field, this paper combines the Vehicle Routing Problem (VRP) (in ...
• Robustness and stability in Constraint Programming under dynamism and uncertainty 

  Climent, Laura; Wallace, Richard J.; Salido, Miguel A.; Barber, Frederico (AI Access Foundation, 2014-01-28)

  Many real life problems that can be solved by constraint programming, come from uncertain and dynamic environments. Because of the dynamism, the original problem may change over time, and thus the solution found for the ...
• Extended recommendation-by-explanation 

  Rana, Arpit; D'Addio, Rafael M.; Manzato, Marcelo G.; Bridge, Derek (Springer Nature Switzerland AG, 2022-03-07)

  Studies have shown that there is an intimate connection between the process of computing recommendations and the process of generating corresponding explanations and that this close relationship may lead to better ...

View more