Hifi Mhand

Mhand Hifi

Information about the author Mhand Hifi will soon be added to the site.
Found 26 papers in total
A parallel algorithm for constrained two‐staged two‐dimensional cutting problems
A parallel algorithm for constrained two‐staged two‐dimensional cutting problems
2012
In this paper, we solve the two‐staged two‐dimensional cutting problem...
A parallel algorithm for two‐staged two‐dimensional fixed‐orientation cutting problems
A parallel algorithm for two‐staged two‐dimensional fixed‐orientation cutting problems
2012
In this paper, we study the two‐staged two‐dimensional...
An algorithm for the disjunctively constrained knapsack problem
An algorithm for the disjunctively constrained knapsack problem
2012
This paper proposes an adaptation of the scatter search (SS)...
An augmented beam search‐based algorithm for the circular open dimension problem
An augmented beam search‐based algorithm for the circular open dimension problem
2011
In this paper, we discuss the circular open dimension problem (CODP); that is a...
Local branching‐based algorithms for the disjunctively constrained knapsack problem
Local branching‐based algorithms for the disjunctively constrained knapsack problem
2011
The disjunctively constrained knapsack problem (DCKP) is a variant of the...
Adaptive beam search lookahead algorithms for the circular packing problem
Adaptive beam search lookahead algorithms for the circular packing problem
2010
This paper addresses the circular packing problem (CPP), which consists in packing n...
A cooperative algorithm for constrained two-staged two-dimensional cutting problems
A cooperative algorithm for constrained two-staged two-dimensional cutting problems
2010
In this paper, we propose a cooperative algorithm for approximately solving the...
A literature review on circle and sphere packing problems: Models and methodologies
A literature review on circle and sphere packing problems: Models and methodologies
2009
This paper reviews the most relevant literature on efficient models and methods for...
Adaptive algorithms for Circular Cutting/packing problems
Adaptive algorithms for Circular Cutting/packing problems
2009
In this paper, the Circular Cutting (CC)/packing problem is studied. Its objective is...
Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem
Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem
2008
This paper solves FC_2TDC, the two–staged fixed–orientation...
Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item
Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item
2008
In this paper, we study the sensitivity of the optimum of a max–min...
Strip generation algorithms for constrained two-dimensional two-staged cutting problems
Strip generation algorithms for constrained two-dimensional two-staged cutting problems
2006
The constrained two-dimensional cutting (C_TDC) problem consists of determining a...
An exact algorithm for constrained two-dimensional two-staged cutting problems
An exact algorithm for constrained two-dimensional two-staged cutting problems
2005
The constrained two-dimensional cutting (C_TDC) problem consists of determining a...
An exact algorithm for the knapsack sharing problem
An exact algorithm for the knapsack sharing problem
2005
In this paper, we develop an exact algorithm for solving the knapsack sharing problem....
Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary knapsack problem
Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary knapsack problem
2005
In the binary single constraint Knapsack Problem, denoted KP, we are given a knapsack...
A simulated annealing approach for the circular cutting problem
A simulated annealing approach for the circular cutting problem
2004
We propose a heuristic for the constrained and unconstrained circular cutting problem...
Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study
Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study
2004
In this paper we propose two exact algorithms for solving the three-dimensional...
Approximate algorithms for constrained circular cutting problems
Approximate algorithms for constrained circular cutting problems
2004
In this paper, we study the problem of cutting a rectangular plate R of dimensions...
Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
2004
In this paper we propose an algorithm for the constrained two-dimensional cutting...
Constrained two-dimensional cutting stock problems: A best-first branch-and-bound algorithm
Constrained two-dimensional cutting stock problems: A best-first branch-and-bound algorithm
2000
In this paper, we develop a new version of an algorithm for solving exactly some...
A best-first branch-and-bound algorithm for orthogonal rectangular packing problems
A best-first branch-and-bound algorithm for orthogonal rectangular packing problems
1998
In this paper we discuss the problem of packing a set of small rectangles (pieces) in...
Exact algorithms for the guillotine strip cutting/packing problem
Exact algorithms for the guillotine strip cutting/packing problem
1998
In this paper we present exact algorithms for strip cutting/packing problems. The...
The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
1997
We study both weighted and unweighted unconstrained two-dimensional guillotine cutting...
A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems
A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems
1997
In this paper we present a genetic algorithm-based heuristic especially for the...
Papers per page: