A remark on positive topological entropy of -buffer switched flow networks.
A scaling out-of-kilter algorithm for minimum cost flow
A Separable Approximation Dynamic Programming Algorithm for Economic Dispatch With Transmission Losses
A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs.
A variational model for equilibrium problems in a traffic network
We propose a variational model for one of the most important problems in traffic networks, namely, the network equilibrium flow that is, traditionally in the context of operations research, characterized by minimum cost flow. This model has the peculiarity of being formulated by means of a suitable variational inequality (VI) and its solution is called “equilibrium”. This model becomes a minimum cost model when the cost function is separable or, more general, when the jacobian of the cost operator...
A variational model for equilibrium problems in a traffic network
We propose a variational model for one of the most important problems in traffic networks, namely, the network equilibrium flow that is, traditionally in the context of operations research, characterized by minimum cost flow. This model has the peculiarity of being formulated by means of a suitable variational inequality (VI) and its solution is called “equilibrium”. This model becomes a minimum cost model when the cost function is separable or, more general, when the Jacobian of the cost operator...
ACS-TS: Train scheduling using ant colony system.
Adaptive pinning synchronization of complex networks with stochastic perturbations.
Aggregation of networks
Algèbre linéaire et cheminement dans un graphe
Algorithmes de plus courts chemins pour traiter des données floues
An Approximate Method for Optimization of a Network Flow With Inverse Linear Constraints
An extension of the MS pivoting rule to capacitated network flow problems
Analysis of Markov chain algorithms on spanning trees, rooted forests, and connected subgraphs
We analyse a natural edge exchange Markov chain on the set of spanning trees of an undirected graph by the method of multicommodity flows. The analysis is then refined to obtain a canonical path analysis. The construction of the flow and of the canonical paths is based on related path constructions in a paper of Cordovil and Moreira (1993) on block matroids. The estimates of the congestion measure imply a polynomial bound on the mixing time. The canonical paths for spanning trees also yield polynomial...
Analyzing the dynamics of deterministic systems from a hypergraph theoretical point of view
To model the dynamics of discrete deterministic systems, we extend the Petri nets framework by a priority relation between conflicting transitions, which is encoded by orienting the edges of a transition conflict graph. The aim of this paper is to gain some insight into the structure of this conflict graph and to characterize a class of suitable orientations by an analysis in the context of hypergraph theory.
Application de la théorie des graphes au choix des investissements à court terme dans un réseau électrique sujet à avaries
Application of some Graph Invariants to the Analysis of Multiprocessor Interconnection Networks
Bounded expansion in web graphs
In this paper we study various models for web graphs with respect to bounded expansion. All the deterministic models even have constant expansion, whereas the copying model has unbounded expansion. The most interesting case turns out to be the preferential attachment model --- which we conjecture to have unbounded expansion, too.
Calcul des idéaux d'un ordonné fini
Capacity and Maximal Value of the Network Flow with Multiplicative Constraints