On multiflow lexicographics (Q1864616): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/eujc.2002.0614 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2063286318 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4124571 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3292914 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3972951 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimum \((2,r)\)-metrics and integer multiflows / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial approaches to multiflow problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On return path packing. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On some connectivity properties of Eulerian graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4040221 / rank | |||
Normal rank |
Latest revision as of 13:57, 5 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On multiflow lexicographics |
scientific article |
Statements
On multiflow lexicographics (English)
0 references
18 March 2003
0 references
This paper is devoted to multiflow in Eulerian network. It contributes to describing the set \(R\) of feasible vectors. First, the feasible vectors are shown to be bases of a polymatroid \((T,p)\) forming a proper part of the polytope defined by the supply-demand conditions. \(p(V)= \max\{\xi(V):\xi\in R\}\), \(V\subseteq T\) is described by a max-min theorem. Second, the lexicographically minimum (and thereby maximum) feasible vector is found, for an arbitrary ordering of \(T\).
0 references
multiflow
0 references
Eulerian network
0 references
polymatroid
0 references
lexicographics
0 references