Complexity results and exact algorithms for robust knapsack problems

AFM: Atomic force microscopy; EM: Electron microscopy; ESRF: European synchrotron radiation facility; HOPG: Highly ordered pyrolitic graphite; NMR: Nuclear magnetic resonance;

Les boues des stations d’épuration sont des produits résiduaires qui résultent du traitement des eaux usées dans la station d’épuration.. Les effluents urbains,

After providing a description and a formal model of the action plan optimization problem, we present a solution method using the iterated local search based on quality

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

Nevertheless, one can find some approximation results for the k- path partition problem where the objective consists in maximizing the number of edges of the paths that participate

For giving an idea of the number of 0-1 continuous linear knapsack solved for computing bounds and fixing variables in the two codes, we denotes by tour the number of iterations of

The main principle of the approach is twofold: (i) to generate an initial feasible solution as a starting lower bound, and (ii) at different levels of the search tree to determine

There are M vehicles, the depot and all the customers are located in one point, the customers have uniform service times (s i = s ∀ i) and there is a planning horizon of 2 days..