scientific article
From MaRDI portal
Publication:3506696
zbMath1193.90003MaRDI QIDQ3506696
Publication date: 17 June 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
unconstrained optimizationlinear programminginteger programmingdynamic programmingnonlinear programminglarge-scale problems
Nonlinear programming (90C30) Linear programming (90C05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items (9)
Complexity of column generation in network design with path-based survivability mechanisms ⋮ Valuation of American options by the gradient projection method ⋮ Solution of the stochastic \(H_{\infty }\)-optimization problem for discrete time linear systems under parametric uncertainty ⋮ A reconstruction of object properties with significant uncertainties ⋮ Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization ⋮ Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles ⋮ Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding ⋮ Stable iterative Lagrange principle in convex programming as a tool for solving unstable problems
This page was built for publication:
