Search Results - branch AND bound knapsack (problem OR problems) multiobjective evolutionary algorithms*

Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms

Authors: Florios, Kostas Mavrotas, George Diakoulaki, Danae

Source: European Journal of Operational Research. May2010, Vol. 203 Issue 1, p14-21. 8p.

Subject Terms: *ALGORITHMS, *MATHEMATICAL programming, *HEURISTIC, *OPERATIONS research, KNAPSACK problems, EVOLUTIONARY computation, BRANCH & bound algorithms, METRIC system

Improvement of genetic algorithms with decomposition procedures for large-scale multiobjective multidimensional 0-1 knapsack problems incorporating fuzzy goals.

Authors: Kato, Kosuke Sakawa, Masatoshi Ikegame, Toshinori

Source: Electronics & Communications in Japan, Part 3: Fundamental Electronic Science; Dec2000, Vol. 83 Issue 12, p62-69, 8p

Subject Terms: KNAPSACK problems, INTEGER programming, BRANCH & bound algorithms, MATHEMATICAL programming, GENETIC algorithms

Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach.

Authors: Zitzler, Eckart Thiele, Lothar

Source: IEEE Transactions on Evolutionary Computation; Nov1999, Vol. 3 Issue 4, p257, 15p

Subject Terms: ALGORITHMS, KNAPSACK problems, CLUSTER analysis (Statistics), SYSTEMS software, MATHEMATICAL optimization

Advancing local search approximations for multiobjective combinatorial optimization problems.

Authors: Weerasena, Lakmali

Source: Journal of Combinatorial Optimization; Apr2022, Vol. 43 Issue 3, p589-612, 24p

Parallel implementation of an exact two-phase method for the biobjective knapsack problem.

Authors: Chaabane, Khadidja Bouroubi, Sadek Djellouli, Younes

Source: RAIRO: Operations Research (2804-7303); 2024, Vol. 58 Issue 4, p3347-3367, 21p

Subject Terms: COMBINATORIAL optimization, PARALLEL programming, TEST methods, ALGORITHMS, KNAPSACK problems, LITERATURE

Reinforcement Learning for Solving the Knapsack Problem.

Authors: Zhang, Zhenfu Yin, Haiyan Zuo, Liudong et al.

Source: Computers, Materials & Continua; 2025, Vol. 84 Issue 1, p919-936, 18p

Subject Terms: REINFORCEMENT learning, TIME complexity, DYNAMIC programming, COMBINATORIAL optimization, PROBLEM solving, KNAPSACK problems

A Heuristics-Guided Simplified Discrete Harmony Search Algorithm for Solving 0-1 Knapsack Problem.

Authors: Zheng, Fuyuan Cheng, Kanglong Yang, Kai et al.

Source: Algorithms; May2025, Vol. 18 Issue 5, p295, 31p

Subject Terms: SEARCH algorithms, RANDOM operators, KNAPSACK problems, ALGORITHMS, BACKPACKS, HEURISTIC

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

Authors: Bauß, Julius Stiglmayr, Michael

Source: Mathematical Methods of Operations Research; Aug2024, Vol. 100 Issue 1, p85-121, 37p

Subject Terms: BRANCH & bound algorithms, INTEGER programming, INTEGERS

Effect of learning strategies in an evolutionary method: the case of the bi-objective quadratic multiple knapsack problem.

Authors: Aïder, Méziane Gacem, Oussama Hifi, Mhand

Source: Neural Computing & Applications; Jan2023, Vol. 35 Issue 2, p1183-1209, 27p

Subject Terms: KNAPSACK problems, LEARNING strategies, COMBINATORIAL optimization, BACKPACKS, GENETIC algorithms

An efficient binary spider wasp optimizer for multi-dimensional knapsack instances: experimental validation and analysis.

Authors: Abdel-Basset, Mohamed Mohamed, Reda Sallam, Karam M. et al.

Source: Journal of Big Data; 1/28/2025, Vol. 12 Issue 1, p1-56, 56p

Subject Terms: GENETIC algorithms, NP-hard problems, TRANSFER functions, RESEARCH personnel, WASPS, KNAPSACK problems

Reinforcement learning using fully connected, attention, and transformer models in knapsack problem solving.

Source: Concurrency & Computation: Practice & Experience; 4/25/2022, Vol. 34 Issue 9, p1-12, 12p

Subject Terms: REINFORCEMENT learning, KNAPSACK problems, COMPUTATIONAL mathematics, PROBLEM solving, DYNAMIC programming, BACKPACKS, POLYNOMIAL time algorithms

An effective hybrid search method for the quadratic knapsack problem with conflict graphs.

Authors: Qing Zhou Jin-Kao Hao Zhong-Zhong Jiang et al.

Source: Journal of the Operational Research Society; May2024, Vol. 75 Issue 5, p1000-1010, 11p

Subject Terms: KNAPSACK problems

Solution approaches for equitable multiobjective integer programming problems.

Authors: Bashir, Bashir Karsu, Özlem

Source: Annals of Operations Research; Apr2022, Vol. 311 Issue 2, p967-995, 29p

Subject Terms: INTEGER programming, KNAPSACK problems, UTILITY functions, ALGORITHMS

TMHSCA: a novel hybrid two-stage mutation with a sine cosine algorithm for discounted {0-1} knapsack problems.

Authors: Kang, Yan Wang, Haining Pu, Bin et al.

Source: Neural Computing & Applications; Jun2023, Vol. 35 Issue 17, p12691-12713, 23p

Subject Terms: KNAPSACK problems, GREEDY algorithms, DIFFERENTIAL operators, ALGORITHMS, METAHEURISTIC algorithms, DIFFERENTIAL evolution, NP-hard problems

An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem.

Authors: Etminaniesfahani, Alireza Gu, Hanyu Naeni, Leila Moslemi et al.

Source: Annals of Operations Research; Jul2024, Vol. 338 Issue 1, p41-68, 28p

Subject Terms: MATHEMATICAL programming, KNAPSACK problems, NP-hard problems, SCHEDULING, CONSTRAINT programming

A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem.

Authors: Sourd, Francis Spanjaard, Olivier

Source: INFORMS Journal on Computing; Summer2008, Vol. 20 Issue 3, p472-484, 13p, 3 Diagrams, 2 Charts, 7 Graphs

Subject Terms: BRANCH & bound algorithms, COMBINATORIAL optimization, SPANNING trees, PARETO analysis, HYPERSURFACES, NUMERICAL analysis

Enhancing Hyperheuristics for the Knapsack Problem through Fuzzy Logic.

Authors: Olivas, Frumen Amaya, Ivan Ortiz-Bayliss, José Carlos et al.

Source: Computational Intelligence & Neuroscience; 1/25/2021, p1-17, 17p

Subject Terms: FUZZY logic, PARTICLE swarm optimization, KNAPSACK problems, BACKPACKS, FUZZY numbers, FUZZY systems, DYNAMIC programming

On the Hybridization of Memetic Algorithms With Branch-and-Bound Techniques.

Authors: Gallardo, José E. Cotta, Carlos Fernández, Antonio J.

Source: IEEE Transactions on Systems, Man & Cybernetics: Part B; Feb2007, Vol. 37 Issue 1, p77-83, 7p

Subject Terms: COMBINATORIAL optimization, ALGORITHMS, MEMETICS, HEURISTIC, KNAPSACK problems, COMPUTATIONAL complexity

An Interactive Evolutionary Metaheuristic for Multiobjective Combinatorial Optimization.

Authors: Phelps, Selcen Köksalan Jr., Murat

Source: Management Science; Dec2003, Vol. 49 Issue 12, p1726-1738, 13p, 6 Charts

Subject Terms: MULTIPLE criteria decision making, COMBINATORICS, KNAPSACK problems, MEMORY, DECISION making, ALGORITHMS

Evolutionary Many-Objective Algorithms for Combinatorial Optimization Problems: A Comparative Study.

Authors: Behmanesh, Reza Rahimi, Iman Gandomi, Amir H.

Source: Archives of Computational Methods in Engineering; 2021, Vol. 28 Issue 2, p673-688, 16p