Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Persistency in the assignment and transportation problems

From MaRDI portal
Publication:1298743
Jump to:navigation, search

DOI10.1007/BF01194399zbMath0946.90099MaRDI QIDQ1298743

Katarína Cechlárova

Publication date: 22 August 1999

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)


zbMATH Keywords

transportationpersistencyassignment problem


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)


Related Items (4)

Persistency in combinatorial optimization problems on matroids ⋮ Some aspects on solving transportation problem ⋮ Persistency and matroid intersection ⋮ Safety in \(s\)-\(t\) paths, trails and walks



Cites Work

  • Unnamed Item
  • Persistency in maximum cardinality bipartite matchings
  • Rank of maximum matchings in a graph


This page was built for publication: Persistency in the assignment and transportation problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1298743&oldid=13406317"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 10:55.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki