Mathematical programming : essays in honor of George B. Dantzig, part I
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Mathematical programming studies
24 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Variante du titre: | Mélanges :, Dantzig |
| Edition sous un autre format: | • Mathematiacl Programming Essays in Honor of George B. Dantzig Part I, Texte imprimé, 9783642009181 • Mathematiacl Programming Essays in Honor of George B. Dantzig Part I, Texte imprimé, 9783662311158 • Mathematiacl Programming Essays in Honor of George B. Dantzig Part I, Texte imprimé, 9783662311165 |
Obsah:
- 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.