scientific article; zbMATH DE number 108290
From MaRDI portal
Publication:4023747
zbMATH Open0773.90028MaRDI QIDQ4023747FDOQ4023747
Authors: C. Wallacher 
Publication date: 23 January 1993
Title of this publication is not available (Why is that?)
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
interior point methodminimum cost flowfeasible directionsnegative circuitscancel and tighten algorithmsubmodular mincost flow
Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cited In (13)
- Combinatorial Algorithms for the Generalized Circulation Problem
- Non-standard approaches to integer programming
- Combinatorial approximation algorithms for generalized flow problems
- On the relative complexity of 15 problems related to~0/1-integer programming
- A combinatorial approximation algorithm for concurrent flow problem and its application
- Title not available (Why is that?)
- Title not available (Why is that?)
- Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids
- A new algorithm for general matching problems using network flow subproblems
- Combinatorial approaches to multiflow problems
- Negative circuits for flows and submodular flows
- Combinatorial algorithms for the unsplittable flow problem
- A combinatorial interior point method for network flow problems
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)
