The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs (Q1804581): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Optimization Problems: Algorithms, Applications and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the min concave cost flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent extreme flows and application to min concave cost flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum concave-cost network flow problems: Applications, complexity, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the single-source uncapacitated minimum concave-cost network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time solvable concave network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A production-transportation problem with stochastic demand and concave production costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks synthesis and optimum network design problems: Models, solution methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open questions in complexity theory for numerical optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial minimum cost circulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complementary convex structure in global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient solution method for rank two quasiconcave minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly polynomial time algorithms for certain concave minimization problems on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly polynomial algorithm for a production-transportation problem with concave production cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing the requirement space of a transporation problem into polyhedral cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Concave Cost Flows in Certain Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01096764 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055544843 / rank
 
Normal rank

Latest revision as of 11:11, 30 July 2024

scientific article
Language Label Description Also known as
English
The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
scientific article

    Statements

    The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1995
    0 references
    fixed number of sources
    0 references
    nonlinear arc costs
    0 references
    strongly polynomial algorithm
    0 references
    parametric method
    0 references
    minimum concave cost network flow
    0 references
    0 references
    0 references
    0 references

    Identifiers