Výsledky vyhledávání - branch and bound knapsack problem multiobjective (evolutionary OR evolution) algorithms

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

Autoři: Florios, Kostas Mavrotas, George Diakoulaki, Danae

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

Témata: *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.

Autoři: Kato, Kosuke Sakawa, Masatoshi Ikegame, Toshinori

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

Témata: KNAPSACK problems, INTEGER programming, BRANCH & bound algorithms, MATHEMATICAL programming, GENETIC algorithms

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

Autoři: Zitzler, Eckart Thiele, Lothar

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

Témata: ALGORITHMS, KNAPSACK problems, CLUSTER analysis (Statistics), SYSTEMS software, MATHEMATICAL optimization

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

Autoři: Zheng, Fuyuan Cheng, Kanglong Yang, Kai a další

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

Témata: SEARCH algorithms, RANDOM operators, KNAPSACK problems, ALGORITHMS, BACKPACKS, HEURISTIC

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

Autoři: Chaabane, Khadidja Bouroubi, Sadek Djellouli, Younes

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

Témata: COMBINATORIAL optimization, PARALLEL programming, TEST methods, ALGORITHMS, KNAPSACK problems, LITERATURE

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

Autoři: Kang, Yan Wang, Haining Pu, Bin a další

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

Témata: KNAPSACK problems, GREEDY algorithms, DIFFERENTIAL operators, ALGORITHMS, METAHEURISTIC algorithms, DIFFERENTIAL evolution, NP-hard problems

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

Autoři: Abdel-Basset, Mohamed Mohamed, Reda Sallam, Karam M. a další

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

Témata: GENETIC algorithms, NP-hard problems, TRANSFER functions, RESEARCH personnel, WASPS, KNAPSACK problems

Reinforcement Learning for Solving the Knapsack Problem.

Autoři: Zhang, Zhenfu Yin, Haiyan Zuo, Liudong a další

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

Témata: REINFORCEMENT learning, TIME complexity, DYNAMIC programming, COMBINATORIAL optimization, PROBLEM solving, KNAPSACK problems

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

Autoři: Bauß, Julius Stiglmayr, Michael

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

Témata: BRANCH & bound algorithms, INTEGER programming, INTEGERS

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

Autoři: Etminaniesfahani, Alireza Gu, Hanyu Naeni, Leila Moslemi a další

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

Témata: MATHEMATICAL programming, KNAPSACK problems, NP-hard problems, SCHEDULING, CONSTRAINT programming

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

Autoři: Aïder, Méziane Gacem, Oussama Hifi, Mhand

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

Témata: KNAPSACK problems, LEARNING strategies, COMBINATORIAL optimization, BACKPACKS, GENETIC algorithms

Players’ selection for basketball teams, through Performance Index Rating, using multiobjective evolutionary algorithms.

Autoři: Pérez-Toledano, Miguel Ángel Rodriguez, Francisco J. García-Rubio, Javier a další

Zdroj: PLoS ONE; 9/4/2019, Vol. 14 Issue 9, p1-20, 20p

Témata: EVOLUTIONARY algorithms, BASKETBALL teams, SPORTS competitions, SPORTS administration, BIOLOGICAL evolution, DIFFERENTIAL evolution

Geografický termín: SPAIN

Korporace: EUROPEAN Union

Enhancing Hyperheuristics for the Knapsack Problem through Fuzzy Logic.

Autoři: Olivas, Frumen Amaya, Ivan Ortiz-Bayliss, José Carlos a další

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

Témata: 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.

Autoři: Gallardo, José E. Cotta, Carlos Fernández, Antonio J.

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

Témata: COMBINATORIAL optimization, ALGORITHMS, MEMETICS, HEURISTIC, KNAPSACK problems, COMPUTATIONAL complexity

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

Autoři: Qing Zhou Jin-Kao Hao Zhong-Zhong Jiang a další

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

Témata: KNAPSACK problems

Compressed representation for higher-level meme space evolution: a case study on big knapsack problems.

Autoři: Feng, Liang Gupta, Abhishek Ong, Yew-Soon

Zdroj: Memetic Computing; Mar2019, Vol. 11 Issue 1, p3-17, 15p

An Interactive Evolutionary Metaheuristic for Multiobjective Combinatorial Optimization.

Autoři: Phelps, Selcen Köksalan Jr., Murat

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

Témata: MULTIPLE criteria decision making, COMBINATORICS, KNAPSACK problems, MEMORY, DECISION making, ALGORITHMS

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

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

Témata: REINFORCEMENT learning, KNAPSACK problems, COMPUTATIONAL mathematics, PROBLEM solving, DYNAMIC programming, BACKPACKS, POLYNOMIAL time algorithms

Computationally efficient evolutionary optimisation for joint reservoir design-operations.

Autoři: Motevali Bashi Naeini, Elaheh Soltaninia, Shahrokh

Zdroj: Proceedings of ICE: Water Management; Jun2023, Vol. 176 Issue 3, p132-147, 16p

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

Autoři: Behmanesh, Reza Rahimi, Iman Gandomi, Amir H.

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