Calcul des idéaux d'un ordonné fini
Capacity and Maximal Value of the Network Flow with Multiplicative Constraints
Combinatorial identities from the spectral theory of quantum graphs.
Complexity of partial inverse assignment problem and partial inverse cut problem
For a given partial solution, the partial inverse problem is to modify the coefficients such that there is a full solution containing the partial solution, while the full solution becomes optimal under new coefficients, and the total modification is minimum. In this paper, we show that the partial inverse assignment problem and the partial inverse minimum cut problem are NP-hard if there are bound constraints on the changes of coefficients.
Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem
For a given partial solution, the partial inverse problem is to modify the coefficients such that there is a full solution containing the partial solution, while the full solution becomes optimal under new coefficients, and the total modification is minimum. In this paper, we show that the partial inverse assignment problem and the partial inverse minimum cut problem are NP-hard if there are bound constraints on the changes of coefficients.
Computation of the limiting distribution in queueing systems with repeated attempts and disasters
Computation of the limiting distribution in queueing systems with repeated attempts and disasters
Single server queues with repeated attempts are useful in the modeling of computer and telecommunication systems. In addition, we consider in this paper the possibility of disasters. When a disaster occurs, all the customers present in the system are destroyed immediately. Using a regenerative approach, we derive a numerically stable recursion scheme for the state probabilities. This model can be employed to analyze the behaviour of a buffer in computers with virus infections.
Computational complexity of integrated models of network design and facility location.
Consensus-based state estimation for multi-agent systems with constraint information
This paper considers a distributed state estimation problem for multi-agent systems under state inequality constraints. We first give a distributed estimation algorithm by projecting the consensus estimate with help of the consensus-based Kalman filter (CKF) and projection on the surface of constraints. The consensus step performs not only on the state estimation but also on the error covariance obtained by each agent. Under collective observability and connective assumptions, we show that consensus...
Cooperative networks games with elastic demands
We present here a pricing model which is an extension of the cooperative game concept and which includes a notion of elastic demand. We present some existence results as well as an algorithm, and we conclude by discussing a specific problem related to network pricing.
Coordinació hidro-tèrmica en la generació d'electricitat per fluxos no lineals multiarticle en xarxes.
La coordinación hidrotérmica a largo plazo trata de hallar, para cada intervalo en que se subdivida un intervalo largo de tiempo, los niveles de generación hidráulica en cada embalse que minimicen el coste esperado de la generación térmica del periodo, teniendo en cuenta que los grupos térmicos no están siempre disponibles, y considerando las distribuciones de probabilidad, para cada intervalo, de la demanda y de las aportaciones de agua de cada embalse.Se extiende aquí la técnica de los flujos...