Hifi M.

M. Hifi

Information about the author M. Hifi will soon be added to the site.
Found 11 papers in total
Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
2007
In this paper, we optimally solve the disjunctively constrained knapsack problem...
A reactive local search-based algorithm for the disjunctively constrained knapsack problem
2006
In this paper, we propose a reactive local search-based algorithm for the...
A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
2006
In this paper, we approximately solve the multiple-choice multi-dimensional knapsack...
Heuristic algorithms for the multiple-choice multidimensional knapsack problem
2004
In this paper, we propose several heuristics for approximately solving the...
A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
2003
The two-dimensional layout (TDL) optimization problem consists of finding the minimal...
Approximate algorithms for the container loading problem
2002
In this paper we develop several algorithms for solving three-dimensional...
The strip cutting/packing problem: Incremental substrip algorithms-based heuristics
1999
The strip cutting problem consists of cutting a large strip with a fixed-width and...
An efficient approach for large-scale two-dimensional guillotine cutting stock problems
1998
We present an efficient method for solving approximately both constrained and...
Best-first search and dynamic programming methods for cutting problems: The cases of one or more stock plates
1997
The problem of generating guillotine cutting patterns for a number of stock entities...
A recursive exact algorithm for weighted two-dimensional cutting
1996
Gilmore and Gomory's algorithm is one of the better actually known exact algorithms...
Constrained two-dimensional cutting: An improvement of Christofides and Whitlock's exact algorithm
1997
Christofides and Whitlock have developed a top-down algorithm which combines in a nice...
Papers per page: