UID:
almahu_9947363022302882
Format:
222 p.
,
online resource.
ISBN:
9783642008023
Series Statement:
Mathematical Programming Studies, 12
Note:
Weakly admissible transformations for solving algebraic assignment and transportation problems -- Cutting planes from conditional bounds: A new approach to set covering -- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study -- On the symmetric travelling salesman problem: Solution of a 120-city problem -- On the symmetric travelling salesman problem: A computational study -- A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation -- Polynomial bounding for NP-hard problems -- Worst case analysis of greedy type algorithms for independence systems -- Quadratic knapsack problems -- Fractional vertices, cuts and facets of the simple plant location problem -- Balanced matrices and property (G) -- Dual integrality in b-matching problems -- A technique for determining blocking and anti-blocking polyhedral descriptions -- Certain kinds of polar sets and their relation to mathematical programming.
In:
Springer eBooks
Additional Edition:
Printed edition: ISBN 9783642008016
Language:
English
URL:
http://dx.doi.org/10.1007/BFb0120883
