Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
Catalogue Display
Catalogue Display
Combinatorial Optimization
.
Bookmark this Record
Catalogue Record 45978
.
.
LibraryThing
.
.
Google Books
.
.
Amazon Books
.
Catalogue Information
Catalogue Record 45978
.
Reviews
Catalogue Record 45978
.
British Library
Resolver for RSN-45978
Google Scholar
Resolver for RSN-45978
WorldCat
Resolver for RSN-45978
Catalogo Nazionale SBN
Resolver for RSN-45978
GoogleBooks
Resolver for RSN-45978
ICTP Library
Resolver for RSN-45978
.
Share Link
Jump to link
Catalogue Information
Field name
Details
Dewey Class
519.6
Title
Combinatorial Optimization ([EBook] /) / edited by M. W. Padberg.
Added Personal Name
Padberg, M. W.
editor.
Other name(s)
SpringerLink (Online service)
Publication
Berlin, Heidelberg : : Springer Berlin Heidelberg, , 1980.
Physical Details
222 p. : online resource.
Series
Mathematical Programming Studies
0303-3929 ; ; 12
ISBN
9783642008023
Contents 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.
System details note
Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site
http://dx.doi.org/10.1007/BFb0120883
Links to Related Works
Subject References:
Computer Science
.
Mathematical optimization
.
Mathematics
.
Mathematics of Computing
.
Optimization
.
Authors:
Padberg, M. W.
.
Corporate Authors:
SpringerLink (Online service)
.
Series:
Mathematical Programming Studies
.
Classification:
519.6
.
.
ISBD Display
Catalogue Record 45978
.
Tag Display
Catalogue Record 45978
.
Related Works
Catalogue Record 45978
.
Marc XML
Catalogue Record 45978
.
Add Title to Basket
Catalogue Record 45978
.
Catalogue Information 45978
Beginning of record
.
Catalogue Information 45978
Top of page
.
Download Title
Catalogue Record 45978
Export
This Record
As
Labelled Format
Bibliographic Format
ISBD Format
MARC Format
MARC Binary Format
MARCXML Format
User-Defined Format:
Title
Author
Series
Publication Details
Subject
To
File
Email
Reviews
This item has not been rated.
Add a Review and/or Rating
45978
1
45978
-
2
45978
-
3
45978
-
4
45978
-
5
45978
-
Quick Search
Search for