Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
From MaRDI portal
Publication:4376170
DOI10.1137/S0097539794263695zbMath0899.90134MaRDI QIDQ4376170
Alexander V. Karzanov, S. Thomas McCormick
Publication date: 10 February 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Deterministic network models in operations research (90B10)
Related Items
Optimal deterministic and robust selection of electricity contracts ⋮ Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment ⋮ Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix ⋮ Local optimality conditions for multicommodity flow problems with separable piecewise convex costs ⋮ 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 ⋮ Scheduling for electricity cost in a smart grid ⋮ A minimum mean cycle cancelling method for nonlinear multicommodity flow problems ⋮ On the complexity of general matrix scaling and entropy minimization via the RAS algorithm ⋮ Greedy oriented flows ⋮ A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices ⋮ Complexity and algorithms for nonlinear optimization problems ⋮ Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks ⋮ Maximum network flows with concave gains ⋮ On project scheduling with irregular starting time costs ⋮ A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints ⋮ The one-machine just-in-time scheduling problem with preemption ⋮ A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives ⋮ New algorithms for convex cost tension problem with application to computer vision ⋮ Unnamed Item ⋮ Scheduling for Electricity Cost in Smart Grid ⋮ Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization
