Výsledky vyhledávání - branch and bound knapsack problems multiobjective evolutionary 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 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

Enhanced Particle Swarm Optimization for Dual-Constraint Multi-Knapsack Problems: A Real-World Retail Packaging Application.

Autoři: Rizqa, Ifan Syukur, Abdul Rijati, Nova a další

Zdroj: Journal Européen des Systèmes Automatisés; Aug2025, Vol. 58 Issue 8, p1745-1756, 12p

Témata: PARTICLE swarm optimization, KNAPSACK problems, PACKAGING design, RETAIL industry, RESOURCE allocation, CONSTRAINT programming, EMPIRICAL research, METAHEURISTIC algorithms

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

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

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

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

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

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

Cooperative multiobjective optimization with bounds on objective functions.

Autoři: Kaliszewski, I. Miroforidis, J.

Zdroj: Journal of Global Optimization; Feb2021, Vol. 79 Issue 2, p369-385, 17p

Témata: KNAPSACK problems, COOPERATIVE societies, PROBLEM solving, BACKPACKS

Sensitivity Analysis of the Cost Coefficients in Multiobjective Integer Linear Optimization.

Autoři: Andersen, Kim Allan Boomsma, Trine Krogh Efkes, Britta a další

Zdroj: Management Science; Feb2025, Vol. 71 Issue 2, p1120-1137, 18p

Témata: LINEAR programming, MULTI-objective optimization, KNAPSACK problems, INTEGER programming, CONVEX sets

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

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

Solution approaches for equitable multiobjective integer programming problems.

Autoři: Bashir, Bashir Karsu, Özlem

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

Témata: INTEGER programming, KNAPSACK problems, UTILITY functions, ALGORITHMS

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

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

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

Autoři: Sourd, Francis Spanjaard, Olivier

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

Témata: BRANCH & bound algorithms, COMBINATORIAL optimization, SPANNING trees, PARETO analysis, HYPERSURFACES, NUMERICAL analysis