All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 3

Displaying 41 – 50 of 50

Showing per page

Strategies for LP-based solving a general class of scheduling problems.

Laureano F. Escudero, Gloria Pérez Sáinz de Rozas (1990)

Trabajos de Investigación Operativa

In this work we describe some strategies that have been proved to be very efficient for solving the following type of scheduling problems: Assume a set of jobs is to be performed along a planning horizon by selecting one from several alternatives for doing so. Besides selecting the alternative for each job, the target consists of choosing the periods at which each component of the work will be done, such that a set of scheduling and technological constraints is satisfied. The problem is formulated...

Une approche hybride pour le sac à dos multidimensionnel en variables 0–1

Michel Vasquez, Jin-Kao Hao (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Nous présentons, dans cet article, une approche hybride pour la résolution du sac à dos multidimensionnel en variables 0–1. Cette approche combine la programmation linéaire et la méthode tabou. L’algorithme ainsi obtenu améliore de manière significative les meilleurs résultats connus sur des instances jugées difficiles.

Une approche hybride pour le sac à dos multidimensionnel en variables 0–1

Michel Vasquez, Jin-Kao Hao (2010)

RAIRO - Operations Research

We present, in this article, a hybrid approach for solving the 0–1 multidimensional knapsack problem (MKP). This approach combines linear programming and Tabu search. The resulting algorithm improves on the best result on many well-known hard benchmarks.

Currently displaying 41 – 50 of 50

Previous Page 3