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

A decomposition algorithm for solving certain classes of production-transportation problems with concave production cost

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

DOI10.1007/BF00229302zbMath0856.90056MaRDI QIDQ1923788

Takahiro Utsunomiya, Takahito Kuno

Publication date: 13 October 1996

Published in: Journal of Global Optimization (Search for Journal in Brave)


zbMATH Keywords

global optimizationresource allocationconcave production costproduction-transportationspecial network structure


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Dynamic programming (90C39) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)


Related Items (2)

Minimizing a linear multiplicative-type function under network flow constraints ⋮ Two level hierarchical time minimizing transportation problem




This page was built for publication: A decomposition algorithm for solving certain classes of production-transportation problems with concave production cost

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