Similar Search Results

A novel core-based optimization framework for binary integer programs- the multidemand multidimesional Knapsack problem as a test problem

Al-Shihabi, Sameh - In: Operations research perspectives 8 (2021), pp. 1-13

solve a set of 126 multidemand multidimensional knapsack problem (MDMKP) instances. We solve the resulting CPs using two …

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

Improving problem reduction for 0-1 multidimensional Knapsack problems with valid inequalities

Gu, Hanyu - In: Computers & operations research : and their … 71 (2016), pp. 82-89

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

A partheno-genetic algorithm for dynamic 0-1 multidimensional Knapsack problem

Ünal, Ali Nadi; Kayakutlu, Gülgün - In: RAIRO / Operations research 50 (2016) 1, pp. 47-66

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

The constrained shortest path tour problem

Ferone, Daniele; Guerriero, Francesca; Laganè, Demetrio - In: Computers & operations research : and their … 74 (2016), pp. 64-77

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

Lagrangean relaxation and hybrid simulated annealing tabu search procedure for a two-echelon capacitated facility location problem with plant size selection

Wu, Tingying; Chu, Feng; Yang, Zhen; Zhou, Zhili; Zhou, Wei - In: International journal of production research 55 (2017) 9/10, pp. 2540-2555

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

Column aggregation-based pricing combinatorial auctions

Drexl, Andreas; Jørnsten, Kurt; Knof, Diether - 2007

Combinatorial auctions permitting bids on bundles of items have been developed to remedy the exposure problem associated with single-item auctions. Given winning bundle prices a set of item prices is called market clearing or equilibrium if all the winning bids are greater than or equal and if...

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