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

scientific article; zbMATH DE number 1263283

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

zbMath0924.90107MaRDI QIDQ4234156

Frits C. R. Spieksma, Fabio Tardella, Maurice Queyranne

Publication date: 16 March 1999


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

latticegreedy algorithmsubmodularitypolymatroidsmulti-index transportation problemssubmodular polyhedraMonge propertiesdual pair of linear programs


Mathematics Subject Classification ID

Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)


Related Items

Approximation algorithms for multi-index transportation problems with decomposable costs, Submodular linear programs on forests, Perspectives of Monge properties in optimization, Matching and multidimensional matching in chordal and strongly chordal graphs, Monge properties, discrete convexity and applications, Geometric three-dimensional assignment problems, The nucleon of cooperative games and an algorithm for matching games, Some recent results in the analysis of greedy algorithms for assignment problems



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