The Minimum Concave Cost Network Flow Problem with fixed numbers of sources and nonlinear arc costs

• We prove that the Minimum Concave Cost Network Flow Problem with fixed numbers of sources and nonlinear arc costs can be solved by an algorithm requiring a number of elementary operations and a number of evaluations of the nonlinear cost functions which are both bounded by polynomials in r, n, m, where r is the number of nodes, n is the number of arcs and m the number of sinks in the network

Ämnesord

TEKNIK OCH TEKNOLOGIER  -- Maskinteknik -- Produktionsteknik, arbetsvetenskap och ergonomi (hsv//swe)

ENGINEERING AND TECHNOLOGY  -- Mechanical Engineering -- Production Engineering, Human Work Science and Ergonomics (hsv//eng)

Nyckelord

Industrial Logistics

Industriell logistik

Publikations- och innehållstyp

ref (ämneskategori)

art (ämneskategori)