A combinatorial interior point method for network flow problems

DOI10.1007/BF01580905MaRDI QIDQ1196185zbMATH OpenFDO

Authors C. Wallacher, Uwe T. Zimmermann

Publication date 17 December 1992

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

minimum cost flownegative circuit methodcombinatorial interior point method

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• Combinatorial interior point methods for generalized network flow problems
• scientific article; zbMATH DE number 108290
• A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS
• Experiments with a hybrid interior point/combinatorial approach for network flow problems
• Polynomial-time primal simplex algorithms for the minimum cost network flow problem

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3989126 (Why is no real title available?)
• A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS
• A new polynomial-time algorithm for linear programming
• An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
• Combinatorial Optimization with Rational Objective Functions
• Polynomial affine algorithms for linear programming

Cited in

(13)

• A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS
• A combinatorial arc tolerance analysis for network flow problems
• INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
• Combinatorial interior point methods for generalized network flow problems
• Solving MIPs via scaling-based augmentation
• scientific article; zbMATH DE number 108290 (Why is no real title available?)
• A Simple Efficient Interior Point Method for Min-Cost Flow
• A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
• Experiments with a hybrid interior point/combinatorial approach for network flow problems
• A hybrid algorithm for solving convex separable network flow problems
• Recent developments in maximum flow algorithms
• An annotated bibliography of network interior point methods
• A Specialized Interior-Point Algorithm for Multicommodity Network Flows

This page was built for publication: A combinatorial interior point method for network flow problems

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