What people are saying - Write a review
We haven't found any reviews in the usual places.
Applications of Combinatorial Optimization
Mathematical Programming Applications in National Regional
On Automatic Differentiation 83
8 other sections not shown
A.J.J. Talman analysis applications approach automatic differentiation base polyhedron BFGS method bundle methods chip combinatorial optimization computational consider constraints convex body decision maker decomposition defined denote derivative dual efficient solution feasible solution finite difference fixed point flows formulation geometric gradient graph heuristics implementation improvement integer programming integral K.C. Kiwiel Kantorovich L.V. Karmarkar's lattice point line search linear programming Lovasz lower bound Mathematical Programming matrix maximal lattice-free minimization mode multi-chip modules network equilibrium node nonlinear equations Nonlinear Programming nonsmooth objective function obtained Operations Research optimal solution optimization problems parallel polyhedra polynomial potential function primal primal-dual projective Proposition quadratic Schnabel secant methods Section simplex method solving space stationary point step stochastic strategy subgradient submodular function submodular system techniques tensor methods Theorem theory tion transportation travelling salesman problem trust region unconstrained optimization variant variational inequality vector vertex