Similar Search Results

Heuristics for the 0-1 multidimensional knapsack problem

Boyer, V.; Elkihel, M.; El Baz, D. - In: European Journal of Operational Research 199 (2009) 3, pp. 658-664

Two heuristics for the 0-1 multidimensional knapsack problem (MKP) are presented. The first one uses surrogate relaxation, and the relaxed problem is solved via a modified dynamic-programming algorithm. The heuristics provides a feasible solution for (MKP). The second one combines a...

Persistent link: https://www.econbiz.de/10004973545

Multi-depot periodic vehicle routing problem with due dates and time windows

Cantu-Funes, Roberto; Salazar-Aguilar, M. Angélica; … - In: Journal of the Operational Research Society 69 (2018) 2, pp. 296-306

Persistent link: https://www.econbiz.de/10012224972

The scale force sizing problem with multi-period workload assignments, and service time windows

Salazar-Aguilar, M. Angélica; Boyer, Vincent; Sanchez … - In: Central European journal of operations research : CEJOR … 27 (2019) 1, pp. 199-218

Persistent link: https://www.econbiz.de/10011965633

A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem

Hernández-Leandro, Noberto A.; Boyer, Vincent; … - In: European journal of operational research : EJOR 272 (2019) 3, pp. 859-867

Persistent link: https://www.econbiz.de/10011942638

Flexible job-shop scheduling problem with resource recovery constraints

Devassia, Jobish Vallikavungal; Salazar-Aguilar, M. … - In: International journal of production research 56 (2018) 9, pp. 3326-3343

Persistent link: https://www.econbiz.de/10011887624

Solution of multidimensional knapsack problems via cooperation of dynamic programming and branch and bound

Boyer, Vincent; Baz, Didier El; Elkihel, Moussa - In: European Journal of Industrial Engineering 4 (2010) 4, pp. 434-449

This article presents an exact cooperative method for the solution of the multidimensional knapsack problem (MKP) which combines dynamic programming and branch and bound. Our method makes cooperate a dynamic programming heuristics based on surrogate relaxation and a branch and bound procedure....

Persistent link: https://www.econbiz.de/10008755658