Pages that link to "Item:Q3813579"

The following pages link to Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems (Q3813579):

Displaying 27 items.

• Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657) (← links)
• A least-squares minimum-cost network flow algorithm (Q646641) (← links)
• Relaxation methods for monotropic programs (Q909583) (← links)
• A survey of dynamic network flows (Q917417) (← links)
• The auction algorithm for the transportation problem (Q918416) (← links)
• Improving the Hungarian assignment algorithm (Q1085073) (← links)
• Dual coordinate step methods for linear network flow problems (Q1115790) (← links)
• On the dual coordinate ascent approach for nonlinear networks (Q1207203) (← links)
• Parallel primal-dual methods for the minimum cost flow problem (Q1315451) (← links)
• The auction algorithm: A distributed relaxation method for the assignment problem (Q1320412) (← links)
• Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations (Q1342646) (← links)
• An incremental primal-dual method for generalized networks (Q1342940) (← links)
• Applying steepest-edge techniques to a network primal-dual algorithm (Q1362969) (← links)
• Efficient parallel algorithms for the minimum cost flow problem (Q1379929) (← links)
• A new dual based procedure for the transportation problem (Q1577109) (← links)
• Simultaneous lotsizing and scheduling on parallel machines (Q1604070) (← links)
• Network DEA-based biobjective optimization of product flows in a supply chain (Q1639292) (← links)
• Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup (Q2239950) (← links)
• A decomposition approach for the general lotsizing and scheduling problem for parallel production lines (Q2355899) (← links)
• Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
• Computational development of a lagrangian dual approach for quadratic networks (Q3977272) (← links)
• Cell formation using a Fuzzy Min-Max neural network (Q4443363) (← links)
• (Q4636980) (← links)
• An ε-Relaxation method for generalized separable convex cost network flow problems (Q4645915) (← links)
• (Q4953319) (← links)
• Min-Cost Flow in Unit-Capacity Planar Graphs (Q5075811) (← links)
• A simple GAP-canceling algorithm for the generalized maximum flow problem (Q5901710) (← links)