scientific article; zbMATH DE number 742963

MaRDI QIDQ4763405zbMATH OpenFDO

Authors Tomasz Radzik

Publication date 11 April 1995

zbMATH Keywords

transshipmentminimum cost network circulation

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Faster algorithms for the quickest transshipment problem
• scientific article; zbMATH DE number 1303551
• scientific article; zbMATH DE number 4079141
• New algorithms for generalized network flows
• Optimal expansion of capacitated transshipment networks

Cited in

(9)

• The quickest flow problem
• Complexity of source-sink monotone 2-parameter min cut
• Optimal expansion of capacitated transshipment networks
• How to compute least infeasible flows
• Two strongly polynomial cut cancelling algorithms for minimum cost network flow
• Approximate binary search algorithms for mean cuts and cycles
• Reshipments and overshipments in transportation problems with minimax objective
• Computing maximum mean cuts
• Tight bounds on the number of minimum-mean cycle cancellations and related results

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763405)