UID:
almahu_9947363030302882
Format:
252 p.
,
online resource.
ISBN:
9783642009198
Series Statement:
Mathematical Programming Studies, 24
Note:
Postoptimal analysis of a linear program under simultaneous changes in matrix coefficients -- On the continuity of the value of a linear program and of related polyhedral-valued multifunctions -- Faces of a polyhedron -- A dantzig-wolfe decomposition variant equivalent to basis factorization -- Dual nested decomposition of staircase linear programs -- A decomposition algorithm for circuit routing -- On the solution of special generalized upper-bounded problems: The LP/GUB knapsack problem and the ?-form separable convex objective function problem -- An efficient algorithm for minimizing a multivariate polyhedral function along a line -- Relationships among linear formulations of separable convex piecewise linear programs -- Basis exchange characterizations for the simplex son algorithm for LP/embedded networks -- Basis graphs of greedoids and two-connectivity -- On the simplex algorithm for networks and generalized networks -- On the facial structure of scheduling polyhedra -- Intermediate feasibility in 0–1 integer linear systems -- Classes of linear programs with integral optimal solutions -- On general decomposition schemes in mathematical programming.
In:
Springer eBooks
Additional Edition:
Printed edition: ISBN 9783642009181
Language:
English
URL:
http://dx.doi.org/10.1007/BFb0121038
