Information about the author Sad Hanafi will soon be added to the site.

Found 26 papers in total

2017

This paper explores the coordinated scheduling problem between production and...

2017

Given a set of items, each with a profit and a weight and a conflict graph describing...

2017

In this paper, we present two general variable neighborhood search (GVNS) based...

2017

In this paper we consider scheduling tasks on a multiprocessor system, taking into...

2017

The p ‐hub median problem consists of choosing p hub locations from a set of...

2017

The 0–1 mixed integer programming problem is used for modeling many...

2017

In a single local search algorithm, several neighborhood structures are usually...

2013

This paper deals with the optimization of a cross‐docking system. It is modeled...

2013

A travelling deliveryman needs to find a tour such that the total waiting time of all...

2013

In this paper we propose various neighborhood search heuristics (VNS) for solving the...

2012

We present a variable neighborhood search approach for solving the...

2012

In the classical bin‐packing problem with conflicts (BPC), the goal is to...

2012

Recently several hybrid methods combining exact algorithms and heuristics have been...

2011

In this paper, we address a variant of the vehicle routing problem called the vehicle...

2011

This study addresses the problem of scheduling the daily assignment of available...

2011

The two‐group classification problem consists in constructing a classifier that...

2010

In this paper we propose a new procedure for classification based on a hybrid...

2009

We propose an efficient dynamic programming algorithm for solving a bilevel program...

2010

In this paper we propose a new hybrid heuristic for solving 0–1 mixed integer...

2007

The exploitation of nested inequalities and surrogate constraints as originally...

2007

This paper focuses on the resolution of the reachability problem in Petri nets, using...

2006

Tabu search has proven highly successful in solving hard combinatorial optimization...

2005

The multidimensional 0–1 knapsack problem (MKP) is a resource allocation model...

2001

The Reverse Elimination Method (REM) is a dynamic strategy for managing the tabu list....

Papers per page:

© Copyright 2018 IFORS - The International Federation of Operational Research Societies.