Network simplex algorithm for the bi-criteria minimum cost flow over time problem

zbMATH Open1249.90033MaRDI QIDQ2881179FDOQ2881179

Mircea Parpalea

Publication date: 3 April 2012

Published in: Bulletin of the Transilvania University of Brașov. Series III. Mathematics, Informatics, Physics (Search for Journal in Brave)

zbMATH Keywords

dynamic networkflows over timenetwork simplex algorithmminimum cost flowsbi-criteria minimum cost flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35) Minimax problems in mathematical programming (90C47)

Cited In (1)

• A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks

   Recommendations

• A network simplex method for the budget-constrained minimum cost flow problem 👍 👎
• Title not available (Why is that?) 👍 👎
• A primal-dual simplex algorithm for bi-objective network flow problems 👍 👎
• Efficient solutions for the bicriteria network flow problem 👍 👎
• An exterior simplex type algorithm for the minimum cost network flow problem 👍 👎
• Solving biobjective network flow problem associated with minimum cost-time loading 👍 👎
• Polynomial-time primal simplex algorithms for the minimum cost network flow problem 👍 👎
• An \(O(nm^ 2)\) time algorithm for solving minimal cost network flow problems 👍 👎
• Title not available (Why is that?) 👍 👎
• A NETWORK SIMPLEX METHOD FOR THE MAXIMUM BALANCED FLOW PROBLEM 👍 👎

This page was built for publication: Network simplex algorithm for the bi-criteria minimum cost flow over time problem

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