C-programming problems: A class of non-linear optimization problems
From MaRDI portal
Recommendations
Cites work
Cited in
(13)- C-programming. An outline
- A class of nonseparable dynamic programming problems
- Fractional programming revisited
- C-programming: A nonlinear parametric optimization method
- Analysis of a class of fractional programming problems
- On pseudolinear functions
- An -approximation scheme for combinatorial optimization problems with minimum variance criterion
- A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
- Linearization method for constrained limit extremal problems
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
- scientific article; zbMATH DE number 1194043 (Why is no real title available?)
- A Solution Strategy for a Class of Nonlinear Knapsack Problems
- C-programming and the minimization of pseudolinear and additive concave functions
This page was built for publication: C-programming problems: A class of non-linear optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798261)