An Optimal Direction and a New Heuristic Algorithm for Quadratic Network Programming

Ming Zhang · 2001

Quadratic Network Programming is frequently dealt with in practical management and economics. Some heuristic algorithms, in the existing literature, are given but have higher complexity. The main objective of this paper is to reduce the complexity. A new optimal direction and a new heuristic algorithm for Quadratic Network Programming are obtained.

Read the paper · More papers on PaperTik