Complexity and algorithms for nonlinear optimization problems
- 3 May 2007
- journal article
- Published by Springer Science and Business Media LLC in Annals of Operations Research
- Vol. 153 (1), 257-296
- https://doi.org/10.1007/s10479-007-0172-6
Abstract
No abstract availableKeywords
This publication has 63 references indexed in Scilit:
- A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow ProblemAlgorithmica, 2004
- Solving the Convex Cost Integer Dual Network Flow ProblemManagement Science, 2003
- Inverse OptimizationOperations Research, 2001
- Network Flows: Theory, Algorithms, and Applications.Journal of the Operational Research Society, 1994
- On an instance of the inverse shortest paths problemMathematical Programming, 1992
- Efficient integer optimization algorithms for optimal coordination of capacitors and regulatorsIEEE Transactions on Power Systems, 1990
- A solvable case of quadratic 0–1 programmingDiscrete Applied Mathematics, 1986
- An O(n) algorithm for quadratic knapsack problemsOperations Research Letters, 1984
- A parametric algorithm for convex cost network flow and related problemsEuropean Journal of Operational Research, 1984
- Time bounds for selectionJournal of Computer and System Sciences, 1973