AbstractThe object of this paper is a simple characterization of the vertices and extreme rays of the undirected multicommodity flow polyhedron F, which has one variable for each channel. This polyhedron is seen as a linear projection of the high-dimensional directed multicommodity flow polyhedron F, which has variables corresponding to each possible tuple of the form (channel, direction, origin, destination). Along with the characterization of vertices and rays of F, a computationally verifiable necessary condition for the vertices is given. It is shown that no polynomially bounded analytical description of F exists, by exhibiting exponentially many facets of F
AbstractIn this paper we propose a branch-and-cut algorithm for the exact solution of an integer mul...
AbstractGiven an undirected Eulerian network with the terminal-set { s } ∪T , we call a vector ξ= (ξ...
Abstract. Let a finite semiorder, or unit interval order, be given. All its numerical representa-tio...
AbstractThe object of this paper is a simple characterization of the vertices and extreme rays of th...
AbstractLet G= (VG, EG) and H= (VH, EH) be two undirected graphs, and VH ⊆ VG. We associate with G a...
. In this paper we give a flow model on directed multigraphs by introducing reflexions of generalize...
AbstractThe integer multicommodity flow problem on a cycle (IMFC) is to find a feasible integral rou...
Consider the polyhedron represented by the dual of the LP formulation of the maximums–t flow problem...
The natural linear programming formulation of the maximum s-t-flow problem in path variables has a d...
AbstractThis paper considers polytopes of circulations (flows) on a graph which satisfy given linear...
We give two results for multicommodity flows in thed-dimensional hypercubeQdwithindependent random e...
The natural linear programming formulation of the maximum s-t-flow problem in path-variables has a d...
AbstractWe introduce a new class of problems concerned with the computation of maximum flows through...
The multicommodity flow problem (MCF) and the length-bounded flow problem (LBF) are two generalisati...
The research was partially supported by CNR, Progetto Finalizzato Trasporti 2Consiglio Nazionale del...
AbstractIn this paper we propose a branch-and-cut algorithm for the exact solution of an integer mul...
AbstractGiven an undirected Eulerian network with the terminal-set { s } ∪T , we call a vector ξ= (ξ...
Abstract. Let a finite semiorder, or unit interval order, be given. All its numerical representa-tio...
AbstractThe object of this paper is a simple characterization of the vertices and extreme rays of th...
AbstractLet G= (VG, EG) and H= (VH, EH) be two undirected graphs, and VH ⊆ VG. We associate with G a...
. In this paper we give a flow model on directed multigraphs by introducing reflexions of generalize...
AbstractThe integer multicommodity flow problem on a cycle (IMFC) is to find a feasible integral rou...
Consider the polyhedron represented by the dual of the LP formulation of the maximums–t flow problem...
The natural linear programming formulation of the maximum s-t-flow problem in path variables has a d...
AbstractThis paper considers polytopes of circulations (flows) on a graph which satisfy given linear...
We give two results for multicommodity flows in thed-dimensional hypercubeQdwithindependent random e...
The natural linear programming formulation of the maximum s-t-flow problem in path-variables has a d...
AbstractWe introduce a new class of problems concerned with the computation of maximum flows through...
The multicommodity flow problem (MCF) and the length-bounded flow problem (LBF) are two generalisati...
The research was partially supported by CNR, Progetto Finalizzato Trasporti 2Consiglio Nazionale del...
AbstractIn this paper we propose a branch-and-cut algorithm for the exact solution of an integer mul...
AbstractGiven an undirected Eulerian network with the terminal-set { s } ∪T , we call a vector ξ= (ξ...
Abstract. Let a finite semiorder, or unit interval order, be given. All its numerical representa-tio...