PPRN

swMATH4731MaRDI QIDQ16899FDOQ16899

Author name not available (Why is that?)

Cited In (32)

• On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems
• Title not available (Why is that?)
• A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem
• Implementing an LU factorization for the embedded network simplex algorithm
• A proximal subgradient projection algorithm for linearly constrained strictly convex problems
• Title not available (Why is that?)
• Modeling and analysis of the multiperiod effects of social relationship on supply chain networks
• A multicommodity network-flow problem with side constraints on paths solved by column generation
• A computational study of cost reoptimization for min-cost flow problems
• The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
• A nonlinear optimization package for long-term hydrothermal coordination.
• An implementation of linear and nonlinear multicommodity network flows
• An augmented Lagrangian algorithm for large scale multicommodity routing
• Title not available (Why is that?)
• On the first-order estimation of multipliers from Kuhn-Tucker systems
• A Specialized Interior-Point Algorithm for Multicommodity Network Flows
• A linear model for compound multicommodity network flow problems
• The minimum shift design problem
• Title not available (Why is that?)
• Projected perspective reformulations with applications in design problems
• Improving an interior-point algorithm for multicommodity flows by quadratic regularizations
• An efficient method for nonlinearly constrained networks
• Implementing a proximal algorithm for some nonlinear multicommodity flow problems
• A novel modeling approach for express package carrier planning
• Implementation and test of auction methods for solving generalized network flow problems with separable convex cost
• An extended model and a column generation algorithm for the planar multicommodity flow problem
• Optimal Flows in Dynamic Networks and Algorithms for their Finding
• Solving difficult multicommodity problems with a specialized interior-point algorithm
• Progress Made in Solving the Multicommodity Flow Problem
• A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
• Title not available (Why is that?)
• Algorithms for Finding Optimal Flows in Dynamic Networks

This page was built for software: PPRN