Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
DOI10.1287/MOOR.19.1.94zbMATH Open0802.90073OpenAlexW1972029377MaRDI QIDQ4294732FDOQ4294732
Authors: Steven Cosares, Dorit S. Hochbaum 
Publication date: 12 December 1994
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.19.1.94
Recommendations
- A strongly polynomial algorithm for the transportation problem
- A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
- POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS
- Strongly polynomial algorithm for a production-transportation problem with concave production cost
- scientific article; zbMATH DE number 1139465
Quadratic programming (90C20) Programming involving graphs or networks (90C35) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cited In (24)
- Complexity and algorithms for nonlinear optimization problems
- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- On one polynomially solvable case of the decentralized transportation problem
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- A quasi-linear algorithm for calculating the infimal convolution of convex quadratic functions
- A binary integer program to maximize the agreement between partitions
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
- A nonlinear knapsack problem
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality
- A Newton's method for the continuous quadratic knapsack problem
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- Strongly polynomial time algorithms for certain concave minimization problems on networks
- Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs
- A survey on the continuous nonlinear resource allocation problem
- A strongly polynomial algorithm for the transportation problem
- A polynomial case of convex integer quadratic programming problems with box integer constraints
- A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian
- Fast algorithm for singly linearly constrained quadratic programs with box-like constraints
- An efficient hybrid algorithm for the separable convex quadratic knapsack problem
- On a Reduction for a Class of Resource Allocation Problems
This page was built for publication: Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4294732)
