We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...
Antoine Jouglet, David Savourey, Jacques Carlier, ...
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
Abstract—A number of population based optimization algorithms have been proposed in recent years to solve unconstrained and constrained single and multi-objective optimization pr...
Hemant K. Singh, Amitay Isaacs, Trung Thanh Nguyen...
Multiobjective evolutionary algorithms (MOEA) are an effective tool for solving search and optimization problems containing several incommensurable and possibly conflicting objec...