8 citations · 16 across the 6 of their papers we have counts for
6 papers
Heuristic and exact fixation-based approaches for the discounted 0-1 knapsack problem
C. Wilbaut, R. Todosijevic, S. Hanafi +1
In this paper we consider the discounted 0-1 knapsack problem (DKP), which is an extension of the classical knapsack problem where a set of items is decomposed into groups of three…
Bi-objective Optimization of Biclustering with Binary Data
Fred Glover, Said Hanafi, Gintaras Palubeckis
Clustering consists of partitioning data objects into subsets called clusters according to some similarity criteria. This paper addresses a generalization called quasi-clustering t…
Solving the Periodic Timetabling Problem using a Genetic Algorithm
Diego Arenas, Remy Chevirer, Said Hanafi +1
In railway operations, a timetable is established to determine the departure and arrival times for the trains or other rolling stock at the different stations or relevant points in…
A Dynamic Multimedia User-Weight Classification Scheme for IEEE_802.11 WLANs
Ahmed Riadh Rebai, Said Hanafi
In this paper we expose a dynamic traffic-classification scheme to support multimedia applications such as voice and broadband video transmissions over IEEE 802.11 Wireless Local A…
An Adaptive Multimedia-Oriented Handoff Scheme for IEEE 802.11 WLANs
Ahmed Riadh Rebai, Saïd Hanafi
Previous studies have shown that the actual handoff schemes employed in the IEEE 802.11 Wireless LANs (WLANs) do not meet the strict delay constraints placed by many multimedia app…
Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search
Sylvain Boussier, Michel Vasquez, Yannick Vimont +2
We propose an exact method which combines the resolution search and branch & bound algorithms for solving the 0?1 Multidimensional Knapsack Problem. This algorithm is able to prove…