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

The effectiveness and efficiency of optimization algorithms might deteriorate when solving large-scale binary integer programs (BIPs). Consequently, researchers have tried to fix the values of certain variables called adjunct variables, and only optimize a small problem version formed from the...

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

A branch-and-price algorithm for the Multiple Knapsack Problem

Lalonde, Olivier; Côté, Jean-François; Gendron, Bernard - 2021

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

Augmenting bi-objective branch and bound by scalarization-based information

Bauß, Julius C.; Stiglmayr, Michael - In: Mathematical methods of operations research : ZOR 100 (2024) 1, pp. 85-121

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

Tight upper and lower bounds for the quadratic knapsack problem through binary decision diagram

Fennich, M. Eliass; Coelho, Leandro C.; Djeumou Fomeni, … - 2024

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

On upper bounds for the multiple knapsack assignment problem

Galli, Laura; Letchford, Adam N. - In: Operations research letters : a journal of INFORMS … 54 (2024), pp. 1-6

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

Learning-accelerated mixed-integer quadratic programming for unit commitment

Maisonneuve, Philippe; Lesage-Landry, Antoine - 2024

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

A massively parallel exact solution algorithm for the balanced minimum evolution problem

Catanzaro, Daniele; Frohn, Martin; Gascuel, Olivier; … - 2023

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

Heuristic concentration and tabu search : a nose to nose comparison

Rosing, K. E.; ReVelle, C. S. - 1997

In 1997 two papers new applying the metaheuristics Tabu Search (TS) and Heuristic Concentration (HC) tothe p-median problem were published in consecutive volumes of the European Journal of OperationalResearch. Here we apply the method of HC some of the data sets which were used for...

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

Evaluation of scalarization methods and NSGA-II/SPEA2 genetic algorithms for multi-objective optimization of green supply chain design

Plas, Corné van der; Tervonen, Tommi; Dekker, Rommert - 2012

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

Convex hull results for the warehouse problem

Wolsey, Laurence A.; Yaman, Hande - 2017

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