Similar Search Results

Towards more efficient local search for weighted graph coloring problem in massive graphs

Pan, Shiwei; Zhao, Yujiao; Li, Jiangnan; Wang, Yiyuan; … - In: Computers & operations research : an international journal 179 (2025), pp. 1-20

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

A novel local search algorithm with configuration checking and scoring mechanism for the set k-covering problem

Wang, Yiyuan; Yin, Minghao; Ouyang, Dantong; Zhang, Liming - In: International transactions in operational research : … 24 (2017) 6, pp. 1463-1485

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

NuMWVC : a novel local search for minimum weighted vertex cover problem

Li, Ruizhi; Hu, Shuli; Cai, Shaowei; Gao, Jian; Wang, Yiyuan - In: Journal of the Operational Research Society 71 (2020) 9, pp. 1498-1509

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

An efficient local search algorithm for minimum positive influence dominating set problem

Sun, Rui; Wu, Jieyu; Jin, Chenghou; Wang, Yiyuan; Zhou, … - In: Computers & operations research : and their … 154 (2023), pp. 1-14

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

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

An optimization framework for solving large scale multidemand multidimensional knapsack problem instances employing a novel core identification heuristic

Al-Shihabi, Sameh - In: European journal of operational research : EJOR 320 (2025) 3, pp. 496-504

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

A hybrid of max-min ant system and linear programming for the k-covering problem

Al-Shihabi, Sameh - In: Computers & operations research : and their … 76 (2016), pp. 1-11

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

A fast local search algorithm for minimum sum coloring problem on massive graphs

Li, Yan; Zhao, Mengyu; Zhang, Xindi; Wang, Yiyuan - In: Computers & operations research : an international journal 172 (2024), pp. 1-13

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

A restart local search algorithm with Tabu method for the minimum weighted connected dominating set problem

Li, Ruizhi; Wang, Yupan; Liu, Huan; Li, Ruiting; Hu, Shuli - In: Journal of the Operational Research Society 73 (2022) 9, pp. 2090-2103

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

Modelling and solving the supply marketing order allocation problem with time consistency and bundle discounts

Zhou, Yupeng; Liu, Minghao; Ma, Feifei; Luo, Na; Yin, … - In: Journal of the Operational Research Society 73 (2022) 8, pp. 1682-1691

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