Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
—Multiobjective optimization problems have been widely addressed using evolutionary computation techniques. However, when dealing with more than three conflicting objectives (th...
Mario Garza-Fabre, Gregorio Toscano Pulido, Carlos...
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
Optimal network provisioning is the process of equipping the network with the devices and resources needed to support all traffic demands while minimizing the network cost. Optical...