Results 91 to 100 of about 36,372,437 (161)

Exact Algorithms for the 0-1 Penalized Knapsack Problem

open access: yes, 2015
We consider a generalization of the 0-1 Knapsack problem, that is the Penalized Knapsack Problem. We devise an improved dynamic programming algorithm and a new integer linear formulation of the problem. Further, we propose an exact approach that exploits
Della Croce, Federico   +2 more
core  

Task Assignment with Autonomous and Controlled Agents [PDF]

open access: yes
We analyse assignment problems in which not all agents are controlled by the central planner. The autonomous agents search for vacant tasks guided by their own preference orders defined over subsets of the available tasks. The goal of the central planner
Nicholas Jennings   +4 more
core  

THE 0-1 KNAPSACK PROBLEM WITH A SINGLE CONTINUOUS VARIABLE

open access: yes, 1997
Constraints arising in practice often contain many 0-1 variables and one or a small number of continuous variables. Existing knapsack separation routines cannot be used on such constraints.
Laurence A. Wolsey, Hugues Marchand
core  

Solving The 0-1 Multidimensional Knapsack Problem

open access: yes, 2006
This paper presents a meta-heuristic solution approach, Meta-RaPS, to 0-1 Multidimensional Knapsack Problem (0-1 MKP). Meta-RaPS (Meta-heuristic for Randomized Priority Search) constructs a feasible solution at each iteration through priority rules used ...
Moraga, Reinaldo   +3 more
core  

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

PowerNovo2: A generative flow-based approach to non-autoregressive de novo peptide sequencing. [PDF]

open access: yesPLoS Comput Biol
Petrovskiy DV   +7 more
europepmc   +1 more source

Budget-Aware Routing for Long Clinical Text. [PDF]

open access: yesFind ACL ACL
Qureshi K, Martin G, Peng Y.
europepmc   +1 more source

Home - About - Disclaimer - Privacy