Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
From MaRDI portal
Publication:4294732
DOI10.1287/moor.19.1.94zbMath0802.90073MaRDI QIDQ4294732
Dorit S. Hochbaum, Steven Cosares
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
90C35: Programming involving graphs or networks
90C10: Integer programming
90C60: Abstract computational complexity for mathematical programming problems
90C20: Quadratic programming
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
Related Items
A binary integer program to maximize the agreement between partitions, Variable fixing algorithms for the continuous quadratic Knapsack problem, Strongly polynomial time algorithms for certain concave minimization problems on networks, A nonlinear knapsack problem, A survey on the continuous nonlinear resource allocation problem, Breakpoint searching algorithms for the continuous quadratic knapsack problem, Complexity and algorithms for nonlinear optimization problems