Results 31 to 40 of about 5,749 (206)
A Cooperative Learning Approach for the Quadratic Knapsack Problem [PDF]
, 2018 The Quadratic Knapsack Problem (QKP) is a well-known optimization problem aimed to maximize a quadratic objective function subject to linear capacity constraints. It has several applications in different fields such as telecommunications, graph theory, logistics, hydrology and data allocation, among others.
Eduardo Lalla-Ruiz +2 more
openaire +1 more source
Ising formulations of many NP problems [PDF]
, 2014 We provide Ising formulations for many NP-complete and NP-hard problems, including all of Karp's 21 NP-complete problems. This collects and extends mappings to the Ising model from partitioning, covering and satisfiability.
Lucas, Andrew
core +3 more sources
, 2015 Patriksson (2008) provided a then up-to-date survey on the continuous,separable, differentiable and convex resource allocation problem with a single resource constraint.
Patriksson, Michael +1 more
core +1 more source
A Subquadratic Approximation Scheme for Partition
, 2019 The subject of this paper is the time complexity of approximating Knapsack, Subset Sum, Partition, and some other related problems. The main result is an $\widetilde{O}(n+1/\varepsilon^{5/3})$ time randomized FPTAS for Partition, which is derived from a ...
Mucha, Marcin +2 more
core +1 more source
Stochastic Budget Optimization in Internet Advertising
, 2013 Internet advertising is a sophisticated game in which the many advertisers "play" to optimize their return on investment. There are many "targets" for the advertisements, and each "target" has a collection of games with a potentially different set of ...
B. Edelman +21 more
core +1 more source
Knapsack problems in products of groups [PDF]
, 2015 The classic knapsack and related problems have natural generalizations 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.
Frenkel, Elizaveta +2 more
core +1 more source
A library for continuous convex separable quadratic knapsack problems [PDF]
European Journal of Operational Research, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
FRANGIONI, ANTONIO, E. Gorgone
openaire +4 more sources
Speeding up IP-based Algorithms for Constrained Quadratic 0-1 Optimization [PDF]
, 2010 In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelling salesman polytope (TSP).Prominent examples are the quadratic assignment
Buchheim, Christoph +2 more
core +1 more source
Methods in Ecology and Evolution, Volume 17, Issue 5, Page 1519-1534, May 2026.Abstract Optimal allocation of resources to the management of biosecurity risk, threatened species conservation or natural hazards such as bushfires is imperative—because program budgets are usually finite and, therefore, constrained. However, effectively dividing resources among management activities to achieve the greatest benefit remains a ...
Aaron Dodd, Edith Arndt, Anca Hanea
wiley +1 more source
On Integer Programming, Discrepancy, and Convolution
, 2019 Integer programs with a constant number of constraints are solvable in pseudo-polynomial time. We give a new algorithm with a better pseudo-polynomial running time than previous results.
Jansen, Klaus, Rohwedder, Lars
core +1 more source