A polynomial algorithm for minimum quadratic cost flow problems
From MaRDI portal
Publication:761341
DOI10.1016/0377-2217(84)90160-7zbMATH Open0555.90039OpenAlexW1977895455MaRDI QIDQ761341FDOQ761341
Authors: Michel Minoux 
Publication date: 1984
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(84)90160-7
Recommendations
- Solving integer minimum cost flows with separable convex cost objective polynomially
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Finding minimum-cost flows by double scaling
- An algorithm for solving quadratic network flow problems
- Parametric computation of minimum-cost flows with piecewise quadratic costs
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)
Cites Work
- A method of solution for quadratic programs
- The Simplex Method for Quadratic Programming
- Title not available (Why is that?)
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- The ellipsoid method and its consequences in combinatorial optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimum norm problems over transportation polytopes
- Cost operator algorithms for the transportation problem
- A polynomially bounded algorithm for a singly constrained quadratic program
- Title not available (Why is that?)
- Title not available (Why is that?)
- Estimating Nonnegative Matrices from Marginal Data
- Feature Article—The Ellipsoid Method: A Survey
- Title not available (Why is that?)
- On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
- The Lattice Point Covering Theorem for Rectangles
- Dealing with degeneracy in reduced gradient algorithms
- Optimal Routing in a Packet-Switched Computer Network
- A reduced subgradient algorithm
- An operator theory of parametric programming for the transportation problem-I
- Title not available (Why is that?)
- An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
Cited In (25)
- Complexity and algorithms for nonlinear optimization problems
- A proximal subgradient projection algorithm for linearly constrained strictly convex problems
- Scheduling for Electricity Cost in Smart Grid
- Quadratic cost flow and the conjugate gradient method
- Title not available (Why is that?)
- Implementing an “exact” Newton method for separable convex transportation problems
- Efficient methods for selfish network design
- Selfish splittable flows and NP-completeness
- A fast polynomial time algorithm for logistics network flows
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
- Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
- Application of the dual active set algorithm to quadratic network optimization
- Preemptive benchmarking problem: An approach for official statistics in small areas
- Solving integer minimum cost flows with separable convex cost objective polynomially
- A survey on the continuous nonlinear resource allocation problem
- Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm
- 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
- New algorithms for convex cost tension problem with application to computer vision
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- Scheduling for electricity cost in a smart grid
- Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs
- Collusion in atomic splittable routing games
This page was built for publication: A polynomial algorithm for minimum quadratic cost flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761341)
