Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
Authors:
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- ALGORITHMS FOR OPTIMAL ALLOCATION PROBLEMS HAVING QUADRATIC OBJECTIVE FUNCTIONJournal of the Operations Research Society of Japan, 1980
- Elements of Large-Scale Mathematical Programming Part I: ConceptsManagement Science, 1970
- The Simplex Method for Quadratic ProgrammingEconometrica, 1959
- A convex programming procedureNaval Research Logistics Quarterly, 1959