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 Tag Display
Catalogue Tag Display
MARC 21
Mathematical Programming Essays in Honor of George B. Dantzig Part I
Tag
Description
020
$a9783642009198$9978-3-642-00919-8
082
$a519.6$223
099
$aOnline resource: Springer
245
$aMathematical Programming Essays in Honor of George B. Dantzig Part I$h[EBook] /$cedited by R. W. Cottle.
260
$aBerlin, Heidelberg :$bSpringer Berlin Heidelberg,$c1985.
300
$a252 p.$bonline resource.
336
$atext$btxt$2rdacontent
337
$acomputer$bc$2rdamedia
338
$aonline resource$bcr$2rdacarrier
440
$aMathematical Programming Studies,$x0303-3929 ;$v24
505
$a
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.
538
$aOnline access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
700
$aCottle, R. W.$eeditor.
710
$aSpringerLink (Online service)
830
$aMathematical Programming Studies,$x0303-3929 ;$v24
856
$u
http://dx.doi.org/10.1007/BFb0121038
Quick Search
Search for