Mathematical Programming: State of the Art 1994John R. Birge, Katta G. Murty |
Contents
Connectivity Augmentation Problems in Network Design | 34 |
Can There Be a Unified Theory of Complex Adaptive Systems? | 132 |
Mathematical Programming and the Algebra of Polynomials | 149 |
Copyright | |
8 other sections not shown
Common terms and phrases
algorithm applications approach approximation assignment augmentation balanced bipartite graph bound branch called candidates column combinatorial optimization complexity computational connected consider constraints contains convergence convex corresponding cost decomposition defined denote depends derivatives described determined developed differentiation digraph directed discussed dual edges efficient elements equations evaluation example exists extended feasible Figure formulation function geometry given gradient important inequality initial integer interest iteration linear linear programming Mathematics matrix memory methods minimize moves node nonlinear Note objective obtain Operations pair path perfect polynomial possible problem procedures projective properties quadratic ranking reduced Report Research restricted rule satisfying semidefinite programming sequence signed simple solution solving space step stochastic stochastic programs strategy structure subset symmetric matrix tabu term Theorem Theory University variables vector