Information about the author Sad Hanafi will soon be added to the site.
New complexity results on scheduling problem in a robotic cell
This paper explores the coordinated scheduling problem between production and...
Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
Given a set of items, each with a profit and a weight and a conflict graph describing...
A general variable neighborhood search variants for the travelling salesman problem with draft limits
In this paper, we present two general variable neighborhood search (GVNS) based...
New MIP model for multiprocessor scheduling problem with communication delays
In this paper we consider scheduling tasks on a multiprocessor system, taking into...
A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem
The p ‐hub median problem consists of choosing p hub locations from a set of...
Mathematical programming based heuristics for the 0‐1 MIP: a survey
The 0–1 mixed integer programming problem is used for modeling many...
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
In a single local search algorithm, several neighborhood structures are usually...
Three‐stage hybrid‐flowshop model for cross‐docking
This paper deals with the optimization of a cross‐docking system. It is modeled...
Variable neighborhood search for the travelling deliveryman problem
A travelling deliveryman needs to find a tour such that the total waiting time of all...
Variable neighborhood search for location routing
In this paper we propose various neighborhood search heuristics (VNS) for solving the...
A general variable neighborhood search for the one‐commodity pickup‐and‐delivery travelling salesman problem
We present a variable neighborhood search approach for solving the...
The min‐conflict packing problem
In the classical bin‐packing problem with conflicts (BPC), the goal is to...
Iterative semi‐continuous relaxation heuristics for the multiple‐choice multidimensional knapsack problem
Recently several hybrid methods combining exact algorithms and heuristics have been...
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo‐polynomial model
In this paper, we address a variant of the vehicle routing problem called the vehicle...
Improved convergent heuristics for the 0‐1 multidimensional knapsack problem
This study addresses the problem of scheduling the daily assignment of available...
Tabu search approaches for solving the two‐group classification problem
The two‐group classification problem consists in constructing a classifier that...
A mathematical programming based procedure for breast cancer classification
In this paper we propose a new procedure for classification based on a hybrid...
A dynamic programming algorithm for the bilevel knapsack problem
We propose an efficient dynamic programming algorithm for solving a bilevel program...
Variable neighbourhood decomposition search for 0–1 mixed integer programs
In this paper we propose a new hybrid heuristic for solving 0–1 mixed integer...
Exploiting nested inequalities and surrogate constraints
The exploitation of nested inequalities and surrogate constraints as originally...
Mathematical programming approach to the Petri nets reachability problem
This paper focuses on the resolution of the reachability problem in Petri nets, using...
Tabu search: global intensification using dynamic programming
Tabu search has proven highly successful in solving hard combinatorial optimization...
The multidimensional 0–1 knapsack problem – bounds and computational aspects
The multidimensional 0–1 knapsack problem (MKP) is a resource allocation model...
Extension of reverse elimination method through a dynamic management of the tabu list
The Reverse Elimination Method (REM) is a dynamic strategy for managing the tabu list....
Papers per page: