Combinatorial Algorithms for the Generalized Circulation Problem
From MaRDI portal
Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic network models in operations research (90B10) Linear programming (90C05) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- A Faster Combinatorial Algorithm for the Generalized Circulation Problem
- Combinatorial approximation algorithms for generalized flow problems
- Exact Algorithms for Generalized Combinatorial Optimization Problems
- scientific article; zbMATH DE number 108290
- Combinatorial algorithms for the unsplittable flow problem
- Approximation and Online Algorithms
- scientific article; zbMATH DE number 1382333
- Combinatorial algorithms for inverse network flow problems
- A polynomial dual simplex algorithm fot the generalized circulation problem.
- Combinatorial algorithms for the minimum interval cost flow problem
Cited in
(22)- Uncovering generalized-network structure in matrices
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
- Improving time bounds on maximum generalised flow computations by contracting the network
- Convex generalized flows
- Recognizing a class of bicircular matroids
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
- Generalized max flow in series-parallel graphs
- Maximum network flows with concave gains
- Combinatorial approximation algorithms for generalized flow problems
- A strongly polynomial algorithm for generalized flow maximization
- Currency arbitrage detection using a binary integer programming model
- scientific article; zbMATH DE number 4057295 (Why is no real title available?)
- Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
- An -relaxation method for generalized separable convex cost network flow problems
- A Faster Combinatorial Algorithm for the Generalized Circulation Problem
- A critical survey on the network optimization algorithms for evacuation planning problems
- Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains
- A simple GAP-canceling algorithm for the generalized maximum flow problem
- Win-win match using a genetic algorithm
- Multi-commodity flow problem on lossy network with partial lane reversals
- Shortest path and maximum flow problems in networks with additive losses and gains
- Generalized maximum flow over time with intermediate storage
This page was built for publication: Combinatorial Algorithms for the Generalized Circulation Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3362078)
