scientific article; zbMATH DE number 108290

MaRDI QIDQ4023747zbMATH OpenFDO

Authors C. Wallacher

Publication date 23 January 1993

zbMATH Keywords

interior point methodminimum cost flowfeasible directionsnegative circuitscancel and tighten algorithmsubmodular mincost flow

Mathematics Subject Classification ID

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

Recommendations

• A combinatorial interior point method for network flow problems
• Combinatorial interior point methods for generalized network flow problems
• Negative circuits for flows and submodular flows
• A submodular network simplex method
• A PRIMAL ALGORITHM FOR THE SUBMODULAR FLOW PROBLEM WITH MINIMUM-MEAN CYCLE SELECTION

Cited in

(13)

• Negative circuits for flows and submodular flows
• On the relative complexity of 15 problems related to~0/1-integer programming
• A new algorithm for general matching problems using network flow subproblems
• Combinatorial algorithms for the unsplittable flow problem
• scientific article; zbMATH DE number 3956777 (Why is no real title available?)
• Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids
• Combinatorial approximation algorithms for generalized flow problems
• Combinatorial approaches to multiflow problems
• A combinatorial approximation algorithm for concurrent flow problem and its application
• Combinatorial Algorithms for the Generalized Circulation Problem
• A combinatorial interior point method for network flow problems
• Non-standard approaches to integer programming
• scientific article; zbMATH DE number 4057295 (Why is no real title available?)

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 Q4023747)