Persistency in the assignment and transportation problems

Katarina Cechlárová ()

Mathematical Methods of Operations Research, 1998, vol. 47, issue 2, 243-254

Abstract: LetG=(U,V,E) be a bipartite graph with weights of its edgesc ij . For the assignment and transportation problem given by such a graph we propose efficient procedures for partitioning the edge setE into three classes:E o is the set of edgesij withx ij =0 for each optimum solution (0-persistent edges);E 1 is the set of edges withx ij > 0 and constant for each optimum (1-persistent edges) andE w is the set of edges such that there are two optimum solutions x, x′ withx ij ≠x ij 1 (weakly persistent edges). Copyright Physica-Verlag 1998

Keywords: Assignment problem; Transportation problem; Persistency (search for similar items in EconPapers)
Date: 1998
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/BF01194399 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:47:y:1998:i:2:p:243-254

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/BF01194399

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().