C-programming. An outline
From MaRDI portal
Publication:1060962
DOI10.1016/0167-6377(85)90045-8zbMath0569.90079OpenAlexW1978489703MaRDI QIDQ1060962
Publication date: 1985
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(85)90045-8
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
Experiments with dynamic programming algorithms for nonseparable problems, Fractional programming revisited, C-programming: A nonlinear parametric optimization method, Analysis of a class of fractional programming problems, The joint replenishment problem with variable production costs, An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion, A fully polynomial time approximation scheme for minimum cost-reliability ratio problems, C-programming and the minimization of pseudolinear and additive concave functions, A Solution Strategy for a Class of Nonlinear Knapsack Problems, A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program, The simplex method as a global optimizer: A \(C\)-programming perspective, Solution strategies for variance minimization problems, A class of nonseparable dynamic programming problems
Cites Work
