Send-and-Split Method for Minimum-Concave-Cost Network Flows
From MaRDI portal
Recommendations
- Minimum-aggregate-concave-cost multicommodity flows in strong-series-parallel networks
- A minimum concave-cost dynamic network flow problem with an application to lot-sizing
- A composite algorithm for a concave-cost network flow problem
- A decomposition method for the min concave cost flow problem with a staircase structure
- Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks.
Cited in
(77)- Minimum-cost single-source 2-splittable flow
- Polynomially solvable special cases of the Steiner problem in planar networks
- The role of Steiner hulls in the solution to Steiner tree problems
- Two new criteria for finding Steiner hulls in Steiner tree problems
- The point-to-point delivery and connection problems: Complexity and algorithms
- Steiner trees with n terminals among n+1 nodes
- Global search algorithms for minimum concave-cost network flow problems
- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
- On obstructions to small face covers in planar graphs
- Minimal connected enclosures on an embedded planar graph
- An algorithm for a concave production cost network flow problem
- Two-edge connected spanning subgraphs and polyhedra
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
- On perfectly two-edge connected graphs
- On finding two-connected subgraphs in planar graphs
- A simplex algorithm for a class of Leontief flow problems
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
- A dynamic programming approach for the pipe network layout problem
- Valid inequalities for separable concave constraints with indicator variables
- Gainfree Leontief substitution flow problems
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
- Probabilistic local search algorithms for concave cost transportation network problems
- Uncapacitated point-to-multipoint network flow problem and its application to multicasting in telecommunication networks
- Packing Steiner trees: A cutting plane algorithm and computational results
- Shortest paths algorithms: Theory and experimental evaluation
- Perspectives of Monge properties in optimization
- Improved Steiner tree algorithms for bounded treewidth
- Faster algorithm for optimum Steiner trees
- Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
- Strategyproof auction mechanisms for network procurement
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Minimum concave cost flow over a grid network
- Extending the kernel for planar Steiner tree to the number of Steiner vertices
- Complexity and algorithms for nonlinear optimization problems
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
- k-edge connected polyhedra on series-parallel graphs
- Critical extreme points of the 2-edge connected spanning subgraph polytope
- A robust optimization model for distribution network design under a mixed integer set of scenarios
- Box-total dual integrality and edge-connectivity
- On the computational complexity of minimum-concave-cost flow in a two-dimensional grid
- The complexity of welfare maximization in congestion games
- On directed Steiner trees with multiple roots
- A fixed parameter tractable approximation scheme for the optimal cut graph of a surface
- A decomposition method for the min concave cost flow problem with a staircase structure
- On the Steiner 2-edge connected subgraph polytope
- A composite algorithm for a concave-cost network flow problem
- scientific article; zbMATH DE number 1342809 (Why is no real title available?)
- Strong Steiner tree approximations in practice
- Probabilistic analysis of an lp relaxation bound for the steiner problem in networks
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
- Strongly polynomial algorithm for two special minimum concave cost network flow problems
- A branch-and-price algorithm for switch-box routing
- A PTAS for three-edge-connected survivable network design in planar graphs
- The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration
- An Exact Algorithm for the Steiner Forest Problem
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals
- A near-linear approximation scheme for multicuts of embedded graphs with a fixed number of terminals
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs
- Network flow optimization with minimum quantities
- Maximum-stopping-value policies in finite Markov population decision chains
- Approximation algorithms for general one-warehouse multi-retailer systems
- A polynomial-time approximation scheme for planar multiway cut
- Minimum-weight two-connected spanning networks
- A branch-and-price algorithm for the Steiner tree packing problem.
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Minimal-cost network flow problems with variable lower bounds on arc flows
- A fast algorithm for computing optimal rectilinear Steiner trees for extremal point sets
- Faster algorithms for Steiner tree and related problems: from theory to practice
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
- An improved branch and bound algorithm for minimum concave cost network flow problems
- Two-sets cut-uncut on planar graphs
- Extended formulation and branch-and-cut-and-price algorithm for the two connected subgraph problem with disjunctive constraints
- A face cover perspective to _1 embeddings of planar graphs
- A polynomial time algorithm for Steiner tree when terminals avoid a rooted K₄-minor
- A survey of dynamic network flows
- Capacitated lot-sizing with extensions: a review
This page was built for publication: Send-and-Split Method for Minimum-Concave-Cost Network Flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3820348)
