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

An improved disaggregation method for transportation problems

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

DOI10.1007/BF02592058zbMath0515.90058OpenAlexW2058163317MaRDI QIDQ3662998

K. Raimer, Paul Zipkin

Publication date: 1983

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02592058

zbMATH Keywords

aggregationfixed weight disaggregationlarge classical transportation problem


Mathematics Subject Classification ID

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


Related Items

A survey of dynamic network flows, Heuristic methods and applications: A categorized survey



Cites Work

  • Bounds for aggregating nodes in network problems
  • Solution of Large-Scale Transportation Problems Through Aggregation
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3662998&oldid=17126701"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 07:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki