Finding feasible vectors of Edmonds-Giles polyhedra

Research output: Contribution to journalArticle

34 Citations (Scopus)

Abstract

A combinatorial algorithm for finding a feasible vector of the Edmonds-Giles polyhedron is presented. The algorithm is polynomially bounded provided that an oracle is available for minimizing submodular functions. A feasibility theorem is also proved by the algorithm and, as a consequence, a good algorithm for finding an integer-valued modular function between a sub- and a supermodular function is deduced. An important idea in the algorithm is due to Schönsleben and Lawler and Martel: the shortest augmenting paths have to be chosen in a lexicographic order.

Original languageEnglish
Pages (from-to)221-239
Number of pages19
JournalJournal of Combinatorial Theory. Series B
Volume36
Issue number3
DOIs
Publication statusPublished - 1984

Fingerprint

Polyhedron
Lexicographic Order
Submodular Function
Modular Functions
Combinatorial Algorithms
Shortest path
Integer
Theorem

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Finding feasible vectors of Edmonds-Giles polyhedra. / Frank, A.

In: Journal of Combinatorial Theory. Series B, Vol. 36, No. 3, 1984, p. 221-239.

Research output: Contribution to journalArticle

@article{2df2b52ef35a4d4a8ef68cffd0c441fa,
title = "Finding feasible vectors of Edmonds-Giles polyhedra",
abstract = "A combinatorial algorithm for finding a feasible vector of the Edmonds-Giles polyhedron is presented. The algorithm is polynomially bounded provided that an oracle is available for minimizing submodular functions. A feasibility theorem is also proved by the algorithm and, as a consequence, a good algorithm for finding an integer-valued modular function between a sub- and a supermodular function is deduced. An important idea in the algorithm is due to Sch{\"o}nsleben and Lawler and Martel: the shortest augmenting paths have to be chosen in a lexicographic order.",
author = "A. Frank",
year = "1984",
doi = "10.1016/0095-8956(84)90029-7",
language = "English",
volume = "36",
pages = "221--239",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "3",

}

TY - JOUR

T1 - Finding feasible vectors of Edmonds-Giles polyhedra

AU - Frank, A.

PY - 1984

Y1 - 1984

N2 - A combinatorial algorithm for finding a feasible vector of the Edmonds-Giles polyhedron is presented. The algorithm is polynomially bounded provided that an oracle is available for minimizing submodular functions. A feasibility theorem is also proved by the algorithm and, as a consequence, a good algorithm for finding an integer-valued modular function between a sub- and a supermodular function is deduced. An important idea in the algorithm is due to Schönsleben and Lawler and Martel: the shortest augmenting paths have to be chosen in a lexicographic order.

AB - A combinatorial algorithm for finding a feasible vector of the Edmonds-Giles polyhedron is presented. The algorithm is polynomially bounded provided that an oracle is available for minimizing submodular functions. A feasibility theorem is also proved by the algorithm and, as a consequence, a good algorithm for finding an integer-valued modular function between a sub- and a supermodular function is deduced. An important idea in the algorithm is due to Schönsleben and Lawler and Martel: the shortest augmenting paths have to be chosen in a lexicographic order.

UR - http://www.scopus.com/inward/record.url?scp=0000100546&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0000100546&partnerID=8YFLogxK

U2 - 10.1016/0095-8956(84)90029-7

DO - 10.1016/0095-8956(84)90029-7

M3 - Article

AN - SCOPUS:0000100546

VL - 36

SP - 221

EP - 239

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

IS - 3

ER -