Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
From MaRDI portal
Recommendations
- Publication:4886036
- scientific article; zbMATH DE number 1342118
- Solving integer minimum cost flows with separable convex cost objective polynomially
- Convex separable optimization is not much harder than linear optimization
- Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
Cited in
(25)- The one-machine just-in-time scheduling problem with preemption
- New algorithms for convex cost tension problem with application to computer vision
- Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
- Scheduling for electricity cost in a smart grid
- Greedy oriented flows
- A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
- Optimal deterministic and robust selection of electricity contracts
- A faster strongly polynomial time algorithm to solve the minimum cost tension problem
- An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem
- On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
- Complexity and algorithms for nonlinear optimization problems
- Maximum network flows with concave gains
- Local optimality conditions for multicommodity flow problems with separable piecewise convex costs
- A polynomial-time descent method for separable convex optimization problems with linear constraints
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- Scheduling for electricity cost in smart grid
- Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment
- scientific article; zbMATH DE number 910862 (Why is no real title available?)
- A polynomial time algorithm for solving the closest vector problem in zonotopal lattices
- The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game
- Pivot rules for circuit-augmentation algorithms in linear optimization
- Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks
- On project scheduling with irregular starting time costs
- A note on nonconvex minimax theorem with separable homogeneous polynomials
- Scheduling jobs to minimize a convex function of resource usage
This page was built for publication: Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376170)
