Combinatorial Algorithms for the Generalized Circulation Problem
From MaRDI portal
Linear programming (90C05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) 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
(21)- Recognizing a class of bicircular matroids
- Combinatorial approximation algorithms for generalized flow problems
- A simple GAP-canceling algorithm for the generalized maximum flow problem
- Multi-commodity flow problem on lossy network with partial lane reversals
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
- scientific article; zbMATH DE number 4057295 (Why is no real title available?)
- Improving time bounds on maximum generalised flow computations by contracting the network
- Convex generalized flows
- Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
- Uncovering generalized-network structure in matrices
- A strongly polynomial algorithm for generalized flow maximization
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
- Win-win match using a genetic algorithm
- Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains
- 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
- Maximum network flows with concave gains
- An -relaxation method for generalized separable convex cost network flow problems
- Currency arbitrage detection using a binary integer programming model
- Generalized max flow in series-parallel graphs
- 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)
