theoretical computer science, the continuous knapsack problem (also known as the fractional knapsack problem) is an algorithmic problem in combinatorial optimization...

The knapsack problem is the following problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine which items...

The quadratic knapsack problem (QKP), first introduced in 19th century, is an extension of knapsack problem that allows for quadratic terms in the objective...

NP-hard problem reducible to the knapsack problem. The problem can be formulated as an integer linear programming problem. A paper machine can produce an...

maximizing the value of items that can fit in the bin is known as the knapsack problem. A variant of bin packing that occurs in practice is when items can...

value for many hard problems. For example, the Knapsack problem, where there is a set of items, and the goal is to pack the knapsack to get the maximum...

constant function continuous knapsack problem Cook reduction Cook's theorem counting sort covering CRCW Crew (algorithm) critical path problem CSP (communicating...

written that solve the problem in reasonable times in most cases. Similarly, algorithms can solve the NP-complete knapsack problem over a wide range of...

optimization problems are the travelling salesman problem ("TSP"), the minimum spanning tree problem ("MST"), and the knapsack problem. In many such problems, such...

known as submodular optimization subject to submodular cover or submodular knapsack constraint) admits bounded approximation guarantees. Partitioning data...

always problem-dependent. For instance, in the knapsack problem one wants to maximize the total value of objects that can be put in a knapsack of some...

partition problem (WCGTPP) Arc-weighted l-cardinality tree problem (AWlCTP) Multiple knapsack problem (MKP) Maximum independent set problem (MIS) Ant...

include: Problems in combinatorial optimization, such as: The vehicle routing problem, a form of shortest path problem The knapsack problem: Given a set...

Dantzig–Wolfe decomposition Knapsack problem Maximum flow problem Optimization (mathematics) Travelling salesman problem Shadow price List of Jewish American...

applications Design problems in communication Location problems Data mining Graph problems Knapsack and packing problems Mixed integer problems Time tabling...

cipher Exponentiating by squaring Knapsack problem Shor's algorithm Standard Model Symmetry in physics Burnside's problem Classification of finite simple...

problems are known as rendezvous problems. These problems were first introduced informally by Steve Alpern in 1976, and he formalised the continuous version...

Diffie–Hellman assumption): this is the "elliptic curve discrete logarithm problem" (ECDLP). The security of elliptic curve cryptography depends on the ability...

apportionment Equity (economics) International trade Justice (economics) Knapsack problem Nash bargaining game Pizza theorem Price of fairness Aumann, Robert...

simple to analyze. However, some researchers have looked at models of the continuous iterated prisoner's dilemma, in which players are able to make a variable...

"Solve utility-scale quantum optimization problems". Retrieved 2025-02-24. Implementation of the QAOA algorithm for the knapsack problem with Classiq...

Konno; E. Zemel (1991). A Linear Time Algorithm for Solving Continuous Maximin Knapsack Problems. Vol. 10. O.R. Letters. pp. 23, 27. Megiddo, N.; A. Tamir;...

invariant subspaces for completely continuous operators in a Hilbert space while working on the invariant subspace problem. With I. J. Schoenberg he wrote...

Von Neumann's original proof used the Brouwer fixed-point theorem on continuous mappings into compact convex sets, which became a standard method in game...

deviation was a section of track on the Main Western line from the first Knapsack Viaduct to old Glenbrook station in the Blue Mountains of New South Wales...

voting, finding a utilitarian budget-allocation requires solving a knapsack problem, which is NP-hard in theory but can be solved easily in practice. There...

1998). "An improved genetic algorithm for the multiconstrained 0-1 knapsack problem". 1998 IEEE International Conference on Evolutionary Computation Proceedings...

classical NP problems. To cite some of them: graph partitioning, multidimensional knapsack, travelling salesman problem, quadratic assignment problem, set cover...

this way, DFSS is closely related to operations research (solving the knapsack problem), workflow balancing. DFSS is largely a design activity requiring tools...

Lions. In continuous time a mean-field game is typically composed of a Hamilton–Jacobi–Bellman equation that describes the optimal control problem of an individual...