Výsledky vyhledávání - branch and bound knapsack problems multiobjective evolution algorithms*

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

A Multi-Constrained Knapsack Approach for Educational Resource Allocation: Genetic Algorithm with Category- Specific Optimization.

Autoři: Tsamis, George Vassiliou, Giannis Chatzinikolaou, Stavroula a další

Zdroj: Electronics (2079-9292); Oct2025, Vol. 14 Issue 19, p3898, 32p

Témata: EDUCATIONAL resources, RESOURCE allocation, FEASIBILITY studies, SCHOLARLY method, GENETIC algorithms, METAHEURISTIC algorithms, DECISION support systems, KNAPSACK problems

Binary Mountain Gazelle Optimizer and Binary Enhanced Mountain Gazelle Optimizer for 0–1 knapsack problems and uncapacitated facilty location problems.

Autoři: Bas, Emine Ihsan, Aysegul

Zdroj: Evolving Systems; Dec2025, Vol. 16 Issue 4, p1-69, 69p

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

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

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

Chaotic vegetation evolution: leveraging multiple seeding strategies and a mutation module for global optimization problems.

Autoři: Zhong, Rui Zhang, Chao Yu, Jun

Zdroj: Evolutionary Intelligence; Aug2024, Vol. 17 Issue 4, p2387-2411, 25p

Optimizing with Attractor: A Tutorial.

Autoři: Li, Weiqi

Zdroj: ACM Computing Surveys; Sep2024, Vol. 56 Issue 9, p1-41, 41p

Témata: MICROSOFT Visual Basic (Computer program language), INFORMATION theory, ATTRACTORS (Mathematics), OPTIMIZATION algorithms, POLYNOMIAL time algorithms, TRAVELING salesman problem, ANT algorithms, DEEP learning, KNAPSACK problems

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

Developing a New Approach for Assessing and Improving Business Excellence: Integrating Fuzzy Analytic Hierarchical Process and Constraint Programming Model.

Autoři: Petrović, Tijana Tadić, Danijela Marinković, Dragan a další

Zdroj: Symmetry (20738994); Apr2025, Vol. 17 Issue 4, p607, 22p

Témata: ANALYTIC hierarchy process, CONSTRAINT programming, FUZZY numbers, ORGANIZATIONAL performance, RESOURCE allocation, KNAPSACK problems

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

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 branching heuristics for the bi-objective 0/1 unidimensional knapsack problem.

Autoři: Cerqueus, Audrey Gandibleux, Xavier Przybylski, Anthony a další

Zdroj: Journal of Heuristics; Oct2017, Vol. 23 Issue 5, p285-319, 35p

Témata: HEURISTIC, BACKPACKS, LEARNING, POLYNOMIALS, ALGORITHMS

Set Theory-Based Operator Design in Evolutionary Algorithms for Solving Knapsack Problems.

Autoři: Wang, Ran Zhang, Zichao

Zdroj: IEEE Transactions on Evolutionary Computation; Dec2021, Vol. 25 Issue 6, p1133-1147, 15p

Témata: KNAPSACK problems, PROBLEM solving, SET theory, COMBINATORIAL optimization, EVOLUTIONARY algorithms, GENETIC algorithms

Allocation of synchronized phasor measurement units for power grid observability using advanced binary accelerated particle swarm optimization approach.

Autoři: Babu, Rohit Raj, Saurav Mahapatra, Sheila

Zdroj: Journal of Electrical Systems & Information Technology; 9/4/2023, Vol. 10 Issue 1, p1-27, 27p

Témata: PARTICLE swarm optimization, ELECTRIC power distribution grids, METAHEURISTIC algorithms, RENEWABLE energy sources, PHASOR measurement, KNAPSACK problems

Solving knapsack problems using a binary gaining sharing knowledge-based optimization algorithm.

Autoři: Agrawal, Prachi Ganesh, Talari Mohamed, Ali Wagdy

Zdroj: Complex & Intelligent Systems; Feb2022, Vol. 8 Issue 1, p43-63, 21p

Témata: KNAPSACK problems, MATHEMATICAL optimization, PROBLEM solving, BACKPACKS, SHARING, LIFE spans, METAHEURISTIC algorithms

Canonical Duality Theory and Algorithm for Solving Bilevel Knapsack Problems With Applications.

Autoři: Gao, David Yang

Zdroj: IEEE Transactions on Systems, Man & Cybernetics. Systems; Feb2021, Vol. 51 Issue 2, p893-904, 12p

Témata: KNAPSACK problems, DUALITY theory (Mathematics), BACKPACKS, ALGORITHMS, BENCHMARK problems (Computer science), ANALYTICAL solutions

Geografický termín: AUSTRALIA

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

The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects.

Autoři: Fréville, Arnaud Hanafi, SaÏd

Zdroj: Annals of Operations Research; Oct2005, Vol. 139 Issue 1-4, p195-227, 33p

Témata: COMPUTER software development, KNAPSACK problems, HEURISTIC programming, ARTIFICIAL intelligence, MULTIDISCIPLINARY design optimization, INTEGER programming, GENETIC algorithms, COMPUTER arithmetic

A scatter search method for the multidimensional knapsack problem with generalized upper bound constraints.

Alternate Title: 以散佈搜尋法求解附有一般上限限制式之多維背包問題: 李際偉 國立嘉義大學企業管理學系 60054 嘉義市新民路 580 號 梁韵嘉* 元智大學工業工程與管理學系 32003 桃園縣中壢市遠東路 135 號 孫淯晏 國立東華大學資訊工程學系 97401 花蓮縣壽豐鄉志學村大學路二段一號 陳佑善 國立東華大學運籌管理研究所 97401 花蓮縣壽豐鄉志學村大學路二段一號 (Chinese)

Autoři: Li, VincentC. Liang, Yun-Chia Sun, Yu-Yen a další

Zdroj: Journal of the Chinese Institute of Industrial Engineers; Dec2012, Vol. 29 Issue 8, p559-571, 13p, 1 Diagram, 5 Charts

Témata: KNAPSACK problems, HEURISTIC, MULTIDIMENSIONAL databases, GREEDY algorithms, SEARCH algorithms, ELECTRONIC information resource searching