KOBV-Portal

Treffer pro Seite

Treffer 1 - 2 | 2 Treffer

Sortierung

Online-Ressource

Combinatorial Optimization (1980)

Padberg, M. W. [editor.] ; SpringerLink 〈Online service〉

Berlin, Heidelberg :Springer Berlin Heidelberg,

Dazugehörige Titel

zur Merkliste hinzufügen auf der Merkliste

Details

UID:

almahu_9947363022302882

Umfang: 222 p. , online resource.

ISBN: 9783642008023

Serie: Mathematical Programming Studies, 12

Anmerkung: 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

Weitere Ausg.: Printed edition: ISBN 9783642008016

Sprache: Englisch

DOI: 10.1007/BFb0120883

URL: http://dx.doi.org/10.1007/BFb0120883

Bookmarklink