Related papers: Phase transition in the knapsack problem
Quantum computer algorithms can exploit the structure of random satisfiability problems. This paper extends a previous empirical evaluation of such an algorithm and gives an approximate asymptotic analysis accounting for both the average…
We consider a variant of the knapsack problem, where items are available with different possible weights. Using a separate budget for these item improvements, the question is: Which items should be improved to which degree such that the…
We consider the 0-1 Incremental Knapsack Problem (IKP) where the capacity grows over time periods and if an item is placed in the knapsack in a certain period, it cannot be removed afterwards. The contribution of a packed item in each time…
If a given behavior of a multi-agent system restricts the phase variable to a invariant manifold, then we define a phase transition as change of physical characteristics such as speed, coordination, and structure. We define such a phase…
In the knapsack problem under explorable uncertainty, we are given a knapsack instance with uncertain item profits. Instead of having access to the precise profits, we are only given uncertainty intervals that are guaranteed to contain the…
The transition between low and high density phases is a typical feature of systems with social interactions. This contribution focuses on simple evacuation design of one room with one entrance and one exit; four passing-through experiments…
A system of particles is studied in which the stochastic processes are one-particle type-change (or one-particle diffusion) and multi-particle annihilation. It is shown that, if the annihilation rate tends to zero but the initial values of…
Quantum computers, with parallel computing and entanglement effects, excel in cryptography analysis and big data processing. However, they are not fully developed yet, and their performance needs further evaluation. Traditional computer…
We generalize previous studies on critical phenomena in communication networks by adding computational capabilities to the nodes to better describe real-world situations such as cloud computing. A set of tasks with random origin and…
This paper considers the optimal control of time varying continuous time Markov chains whose transition rates are themselves Markov processes. In one set of problems the solution of an ordinary differential equation is shown to determine…
Random constraint satisfaction problems play an important role in computer science and combinatorics. For example, they provide challenging benchmark instances for algorithms and they have been harnessed in probabilistic constructions of…
We consider a model of binary opinion dynamics where one opinion is inherently 'superior' than the other and social agents exhibit a 'bias' towards the superior alternative. Specifically, it is assumed that an agent updates its choice to…
We consider a bilevel continuous knapsack problem where the leader controls the capacity of the knapsack, while the follower chooses a feasible packing maximizing his own profit. The leader's aim is to optimize a linear objective function…
The min-knapsack problem with compactness constraints extends the classical knapsack problem, in the case of ordered items, by introducing a restriction ensuring that they cannot be too far apart. This problem has applications in…
Number partitioning is an NP-complete problem of combinatorial optimization. A statistical mechanics analysis reveals the existence of a phase transition that separates the easy from the hard to solve instances and that reflects the…
We characterize the conditions under which a multi-time quantum process with a finite temporal resolution can be approximately described by an equilibrium one. By providing a generalization of the notion of equilibration on average, where a…
We analyse the motion of a system of particles subjected a random force fluctuating in both space and time, and experiencing viscous damping. When the damping exceeds a certain threshold, the system undergoes a phase transition: the…
We study the problem of scheduling delay-sensitive jobs over spot and on-demand cloud instances to minimize average cost while meeting an average delay constraint. Jobs arrive as a general stochastic process, and incur different costs based…
We consider the product knapsack problem, which is the variant of the classical 0-1 knapsack problem where the objective consists of maximizing the product of the profits of the selected items. These profits are allowed to be positive or…
Recently, a model of opinion formation with kinetic exchanges has been proposed in which a spontaneous symmetry breaking transition was reported [M. Lallouache et al, Phys. Rev. E, {\bf 82} 056112 (2010)]. We generalise the model to…