Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Raïd Mansi"'
Publikováno v:
International Transactions in Operational Research. 19:353-378
In this paper, we deal with the two-scenario max–min knapsack (MNK) problem. First, we consider several formulations of MNK as a mixed integer programming problem. Then, we propose a hybrid method as an alternative to solve the MNK exactly. The app
Publikováno v:
Computers & Operations Research. 39:32-41
Recently several hybrid methods combining exact algorithms and heuristics have been proposed for solving hard combinatorial optimization problems. In this paper, we propose new iterative relaxation-based heuristics for the 0-1 Mixed Integer Programmi
Publikováno v:
Mathematical Modelling of Natural Phenomena. 5:116-121
The Bilevel Knapsack Problem (BKP) is a hierarchical optimization problem in which the feasible set is determined by the set of optimal solutions of parametric Knapsack Problem. In this paper, we propose two stages exact method for solving the BKP. I
Publikováno v:
Operations Research Letters. 37:215-218
We propose an efficient dynamic programming algorithm for solving a bilevel program where the leader controls the capacity of a knapsack, and the follower solves the resulting knapsack problem. We propose new recursive rules and show how to solve the
Publikováno v:
Mathematical Problems in Engineering, Vol 2015 (2015)
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Despite other variants of the standard knapsack problem, very few solution approaches have been devised for the multiscenario max-min knapsack problem. The problem consists in finding the subset of items whose total profit is maximized under the wors
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
In this article, a new solution approach for the multiple choice multidimensional knapsack problem is described. The problem is a variant of the multidimensional knapsack problem where items are divided into classes, and exactly one item per class ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f9458728526a4b047e32981ae89692b9
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Mathematical Problems in Engineering, Vol 2012 (2012)
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Mathematical Problems in Engineering, Vol 2012 (2012)
In this paper, we propose a new exact method for solving bilevel 0-1 knapsack problems. A bilevel problem models a hierarchical decision process that involves two decision makers called the leader and the follower. In these processes, the leader take
Publikováno v:
Hybrid Metaheuristics ISBN: 9783642049170
Hybrid Metaheuristics
Hybrid Metaheuristics
The development of efficient hybrid methods for solving hard optimization problems is not new in the operational research community. Some of these methods are based on the complete exploration of small neighbourhoods. In this paper, we apply iterativ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc16e0c552c2f8d6cabe63690c4e570c
https://doi.org/10.1007/978-3-642-04918-7_6
https://doi.org/10.1007/978-3-642-04918-7_6
Publikováno v:
European J. of Industrial Engineering. 6:690
In this paper, we propose an oscillation strategy heuristic combined with mathematical programming for disruption management in the airline industry (DMAI). The goal of this problem is to resume normal operations as quickly as possible during the rec