Separable Optimization : Theory and Methods / Stefan M. Stefanov

• Autore: Stefanov, Stefan M.
• Pubblicazione: Cham, : Springer, 2021
• Edizione: 2. ed
• Descrizione fisica: xvii, 356 p. : ill. ; 24 cm
• Soggetto topico: 52A41 - Convex functions and convex programs in convex geometry [MSC 2020]; 52B12 - Special polytopes (linear programming, centrally symmetric, etc.) [MSC 2020]; 90-XX - Operations research, mathematical programming [MSC 2020]; 90C25 - Convex programming [MSC 2020]; 90C30 - Nonlinear programming [MSC 2020]; 90C39 - Dynamic programming [MSC 2020]; 90C59 - Approximation methods and heuristics in mathematical programming [MSC 2020]
• Soggetto non controllato: Algorithms; Approximation; Bounded variables; Chebyshev approximation; Convex analysis; Convex programming; Dynamic Programming; Knapsack polytope; Knapsack problem; Linear optimization; Mathematical programming; Nonlinear transportation problem; Operations Research; Saddle points Lagrangian; Separable optimization; Separable programming
• Titolo autorizzato: Separable Optimization
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: VAN00275284
• Lo trovi qui: Univ. Vanvitelli
• Localizzazioni e accesso elettronico: https://doi.org/10.1007/978-3-030-78401-0
• Serie: Springer optimization and its applications Berlin [etc.] . -Springer , 2006- ; 177