Results 121 to 130 of about 4,775,611 (190)

Towards Autonomous Bio-Inspired Optimization: Deep Reinforcement Learning for Adaptive Metaheuristic Orchestration. [PDF]

open access: yesBiomimetics (Basel)
Carrasco C   +5 more
europepmc   +1 more source

KNAPSACK PROBLEMS IN PRODUCTS OF GROUPS

open access: yes, 2014
The classic knapsack and related problems have natural general-izations to arbitrary (non-commutative) groups, collectively called knapsack-type problems in groups. We study the effect of free and direct products on their time complexity.
Alexander Ushakov   +2 more
core  

Faster FPTASs for Knapsack problems

open access: yes, 2015
Thesis: S.M., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2015.This electronic version was submitted by the student author.
Rhee, Donguk
core  

Knapsack problems with setup

open access: yes, 2006
This research studies three integer programming models which can be applied to order acceptance in make-to-order manufacturing or regional project selection in multiple periods. All three models are the variations of the binary knapsack problems and they
Yang, Yanchun
core  

New Binary Reptile Search Algorithms for Binary Optimization Problems. [PDF]

open access: yesBiomimetics (Basel)
Crawford B   +8 more
europepmc   +1 more source

Concatenation versus addition in knapsack problems

open access: yes
"Appeared in Information Processing Letters 54 (1995),169-174. We consider the complexity of two knapsack problems that are defined with the operation ``concatenation'' instead of ``addition''.
Jenner Núñez, Birgit
core  

Binary Pufferfish Optimization Algorithm for Combinatorial Problems. [PDF]

open access: yesBiomimetics (Basel)
Crawford B   +9 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy