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 augmentation problem automatic differentiation balanceable bipartite graph bipartite graph branch branch-and-price candidates column combinatorial complexity computational concave Conforti connected constraints contains convergence convex corresponding cost decomposition defined denote derivatives digraph directed graph dual edge-connectivity edges efficient eigenvalues equations evaluation example feasible formulation geometry global optimization gradient graph G Hessian induced subgraph inequality integer integer-valued interior-point methods iteration Jacobian k-edge-connected linear programming LP relaxation Mathematical Programming matrix memory minimize minimum Mulvey Newton Newton's method node nonlinear nonsmooth objective function Operations Research optimal solution optimization problems P. M. Pardalos pair partitioning path polynomial polytope primal primal-dual processors quadratic programming quasi-Newton quasi-Newton methods restricted satisfying scenario Section sequence SIAM signed bipartite graph solving stochastic programs strategy structure sub-partition subgraph subproblem subset subspace symmetric tabu search Theorem trust region undirected undirected graph variables vector