| Publication | Date of Publication | Type |
|---|
Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups
International Transactions in Operational Research | 2023-11-29 | Paper |
A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
Annals of Operations Research | 2021-05-05 | Paper |
A local search-based method for sphere packing problems
European Journal of Operational Research | 2018-12-18 | Paper |
Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
Discrete Optimization | 2018-10-18 | Paper |
Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights
International Transactions in Operational Research | 2018-05-22 | Paper |
Algorithms for the circular two-dimensional open dimension problem
International Transactions in Operational Research | 2018-01-12 | Paper |
An approximation algorithm for the three depots Hamiltonian path problem
Optimization Theory, Decision Making, and Operations Research Applications | 2017-11-30 | Paper |
An adaptive neighborhood search for \(k\)-clustering minimum bi-clique completion problems
Advances in Intelligent Systems and Computing | 2017-09-12 | Paper |
New upper bounds and exact methods for the knapsack sharing problem
Applied Mathematics and Computation | 2017-06-08 | Paper |
An algorithm for the disjunctively constrained knapsack problem
International Journal of Operational Research | 2017-05-31 | Paper |
Solving the circular open dimension problem by using separate beams and look-ahead strategies
Computers \& Operations Research | 2017-01-05 | Paper |
An exact decomposition algorithm for the generalized knapsack sharing problem
European Journal of Operational Research | 2016-10-07 | Paper |
A fast large neighborhood search for disjunctively constrained knapsack problems
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem
International Transactions in Operational Research | 2014-06-20 | Paper |
A linear programming approach for the three-dimensional bin-packing problem
| 2013-11-08 | Paper |
Algorithms for the constrained two-staged two-dimensional cutting problem
INFORMS Journal on Computing | 2012-07-28 | Paper |
A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems
Computational Optimization and Applications | 2012-06-19 | Paper |
Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Adaptive beam search lookahead algorithms for the circular packing problem
International Transactions in Operational Research | 2011-05-20 | Paper |
A literature review on circle and sphere packing problems: models and methodologies
Advances in Operations Research | 2010-11-16 | Paper |
A cooperative algorithm for constrained two-staged two-dimensional cutting problems
International Journal of Operational Research | 2010-11-12 | Paper |
A hybrid beam search looking-ahead algorithm for the circular packing problem
Journal of Combinatorial Optimization | 2010-10-26 | Paper |
A column generation method for the multiple-choice multi-dimensional knapsack problem
Computational Optimization and Applications | 2010-05-07 | Paper |
Adaptive algorithms for circular cutting/packing problems
International Journal of Operational Research | 2009-11-25 | Paper |
Beam search and non-linear programming tools for the circular packing problem
International Journal of Mathematics in Operational Research | 2009-10-12 | Paper |
Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
Computational Optimization and Applications | 2009-09-25 | Paper |
Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
International Journal of Operational Research | 2009-09-13 | Paper |
An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
Operations Research | 2009-07-17 | Paper |
A beam search algorithm for the circular packing problem
Computers \& Operations Research | 2008-12-17 | Paper |
Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
Discrete Optimization | 2008-11-19 | Paper |
Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item
International Transactions in Operational Research | 2008-05-22 | Paper |
Adaptive and restarting techniques-based algorithms for circular packing problems
Computational Optimization and Applications | 2008-04-03 | Paper |
Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item
Computers \& Operations Research | 2007-10-10 | Paper |
Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
Journal of Combinatorial Optimization | 2007-09-10 | Paper |
A dynamic adaptive local search algorithm for the circular packing problem
European Journal of Operational Research | 2007-08-27 | Paper |
Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
Computers \& Operations Research | 2007-04-13 | Paper |
A reactive local search-based algorithm for the disjunctively constrained knapsack problem
The Journal of the Operational Research Society | 2007-01-26 | Paper |
A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
Computational Optimization and Applications | 2006-09-28 | Paper |
Strip generation algorithms for constrained two-dimensional two-staged cutting problems
European Journal of Operational Research | 2006-04-28 | Paper |
An exact algorithm for the knapsack sharing problem
Computers \& Operations Research | 2005-08-03 | Paper |
Heuristic algorithms for the multiple-choice multidimensional knapsack problem
The Journal of the Operational Research Society | 2005-05-23 | Paper |
Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
Journal of Combinatorial Optimization | 2005-03-15 | Paper |
An efficient approach for large-scale two-dimensional guillotine cutting stock problems
The Journal of the Operational Research Society | 2005-01-19 | Paper |
The knapsack sharing problem: an exact algorithm
Journal of Combinatorial Optimization | 2005-01-17 | Paper |
A simulated annealing approach for the circular cutting problem
European Journal of Operational Research | 2004-08-16 | Paper |
A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
International Transactions in Operational Research | 2004-08-10 | Paper |
Approximate algorithms for constrained circular cutting problems
Computers \& Operations Research | 2004-06-15 | Paper |
Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
Computers \& Operations Research | 2004-06-15 | Paper |
Approximate algorithms for the container loading problem
International Transactions in Operational Research | 2004-06-11 | Paper |
Exact algorithms for the guillotine strip cutting/packing problem.
Computers \& Operations Research | 2003-09-07 | Paper |
An efficient algorithm for the knapsack sharing problem
Computational Optimization and Applications | 2003-06-18 | Paper |
Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
Journal of Combinatorial Optimization | 2002-01-08 | Paper |
Exact algorithms for large-scale unconstrained two and three staged cutting problems
Computational Optimization and Applications | 2001-06-26 | Paper |
A neural network for the minimum set covering problem
Chaos, Solitons and Fractals | 2000-12-18 | Paper |
A recursive exact algorithm for weighted two-dimensional cutting
European Journal of Operational Research | 1999-02-22 | Paper |
The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
European Journal of Operational Research | 1999-02-22 | Paper |
Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
The Journal of the Operational Research Society | 1997-11-25 | Paper |
An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
Computers \& Operations Research | 1997-10-26 | Paper |
A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems
The Journal of the Operational Research Society | 1997-08-07 | Paper |
Une amélioration de l'algorithme récursif de Herz pour le problème de découpe à deux dimensions
RAIRO - Operations Research | 1997-04-10 | Paper |
A New Efficient Heuristic for the Minimum Set Covering Problem
The Journal of the Operational Research Society | 1996-09-16 | Paper |
