The branch-and-bound (B&B) algorithmic framework has been used successfully to find
exact solutions for a wide array of optimization problems. B&B uses a tree search strategy to …

Graph colouring is one of those rare examples in the mathematical sciences of a problem
that, while easy to state and visualise, has many aspects that are exceptionally difficult to …

Graph vertex coloring is one of the most studied NP-hard combinatorial optimization
problems. Given the hardness of the problem, various heuristic algorithms have been …

In this paper, a new branch-and-price-and-cut algorithm is proposed to solve the one-
dimensional bin-packing problem (1D-BPP). The 1D-BPP is one of the most fundamental …

Given the increasingly significant impact of an efficient product-location strategy on
warehouses' performance from a service level and operational costs perspective, this paper …

Column Generation (CG) is an effective method for solving large-scale optimization
problems. CG starts by solving a subproblem with a subset of columns (ie, variables) and …

We consider a static decision model related to the management of a Dial-a-Ride (DAR)
system involving small autonomous electrical vehicles in a closed industrial site. Because of …

We study the knapsack problem with conflict graph (KPCG), an extension of the 0-1
knapsack problem, in which a conflict graph describing incompatibilities between items is …

The best method known for determining lower bounds on the vertex coloring number of a
graph is the linear-programming column-generation technique, where variables correspond …

This paper explores techniques for solving the maximum clique and vertex coloring
problems on very large-scale real-life networks. Because of the size of such networks and …