AbstractWe develop a method for computing capacity based on energy minimization. The method applies to a wide variety of capacities, including Riesz, logarithmic and hyperbolic capacities. It yields rigorous upper and lower bounds which converge to the true value of the capacity. The method is illustrated with a number of examples
The Data-Correcting Algorithm (DCA) corrects the data of a hard problem instance in such a way that ...
The Data-Correcting Algorithm (DCA) corrects the data of a hard problem instance in such a way that ...
We study a quadratic nonseparable resource allocation problem that arises in the area of decentraliz...
AbstractWe develop a method for computing capacity based on energy minimization. The method applies ...
AbstractWe introduce a method for computing the weighted capacity of a closed plane set. The method ...
AbstractComputational problems originating from approximations of Choquet capacities are discussed. ...
The paper reformulates Houthakker’s capacity method for quadratic programming in the framework of th...
The paper reformulates Houthakker’s capacity method for quadratic programming in the framework of th...
AbstractComputational problems originating from approximations of Choquet capacities are discussed. ...
AbstractThe binary quadratic knapsack problem maximizes a quadratic objective function subject to a ...
International audienceThis article presents a new method to optimally partition a geometric domain w...
A basic measure of the size of a set E in the complex plane is the logarithmic capacity cap(E). Capa...
AbstractWe introduce a method for computing the weighted capacity of a closed plane set. The method ...
See Video Abstract (click the "Video Abstract" button next to the "PDF" button) A basic measure of t...
The Data-Correcting Algorithm (DCA) corrects the data of a hard problem instance in such a way that ...
The Data-Correcting Algorithm (DCA) corrects the data of a hard problem instance in such a way that ...
The Data-Correcting Algorithm (DCA) corrects the data of a hard problem instance in such a way that ...
We study a quadratic nonseparable resource allocation problem that arises in the area of decentraliz...
AbstractWe develop a method for computing capacity based on energy minimization. The method applies ...
AbstractWe introduce a method for computing the weighted capacity of a closed plane set. The method ...
AbstractComputational problems originating from approximations of Choquet capacities are discussed. ...
The paper reformulates Houthakker’s capacity method for quadratic programming in the framework of th...
The paper reformulates Houthakker’s capacity method for quadratic programming in the framework of th...
AbstractComputational problems originating from approximations of Choquet capacities are discussed. ...
AbstractThe binary quadratic knapsack problem maximizes a quadratic objective function subject to a ...
International audienceThis article presents a new method to optimally partition a geometric domain w...
A basic measure of the size of a set E in the complex plane is the logarithmic capacity cap(E). Capa...
AbstractWe introduce a method for computing the weighted capacity of a closed plane set. The method ...
See Video Abstract (click the "Video Abstract" button next to the "PDF" button) A basic measure of t...
The Data-Correcting Algorithm (DCA) corrects the data of a hard problem instance in such a way that ...
The Data-Correcting Algorithm (DCA) corrects the data of a hard problem instance in such a way that ...
The Data-Correcting Algorithm (DCA) corrects the data of a hard problem instance in such a way that ...
We study a quadratic nonseparable resource allocation problem that arises in the area of decentraliz...