Solving integer minimum cost flows with separable convex cost objective polynomially
From MaRDI portal
Recommendations
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS
- A polynomial combinatorial algorithm for generalized minimum cost flow
- A polynomial algorithm for minimum quadratic cost flow problems
- Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs
- A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems
- A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
- A POLYNOMIAL-TIME DUAL SIMPLEX ALGORITHM FOR THE MINIMUM COST FLOW PROBLEM
- scientific article; zbMATH DE number 1342118
Cited in
(34)- Graver basis and proximity techniques for block-structured separable convex integer minimization problems
- A polynomial-time descent method for separable convex optimization problems with linear constraints
- Complexity and algorithms for nonlinear optimization problems
- Incremental subgradient algorithms with dynamic step sizes for separable convex optimizations
- A capacity scaling algorithm for the constrained maximum flow problem
- A polynomial combinatorial algorithm for generalized minimum cost flow
- Substitution with satiation: a new class of utility functions and a complementary pivot algorithm
- Computation and efficiency of potential function minimizers of combinatorial congestion games
- Parametric computation of minimum-cost flows with piecewise quadratic costs
- A polynomial algorithm for minimum quadratic cost flow problems
- Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
- Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
- Discrete convex analysis
- A capacity scaling algorithm for convex cost submodular flows
- Preemptive benchmarking problem: An approach for official statistics in small areas
- A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
- scientific article; zbMATH DE number 910862 (Why is no real title available?)
- Maximum network flows with concave gains
- Disruption management in production planning
- Use of primal-dual technique in the network algorithm for two-way contingency tables
- Solving the convex cost integer dual network flow problem
- Local optimality conditions for multicommodity flow problems with separable piecewise convex costs
- Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment
- Network flow methods for electoral systems
- Error minimization methods in biproportional apportionment
- Optimal deterministic and robust selection of electricity contracts
- Permutohedra and minimal matrices
- Scheduling for electricity cost in a smart grid
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- A polynomial algorithm for an integer quadratic non-separable transportation problem
- scientific article; zbMATH DE number 4116282 (Why is no real title available?)
- Scheduling for electricity cost in smart grid
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
This page was built for publication: Solving integer minimum cost flows with separable convex cost objective polynomially
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3716775)
