Cuts, matrix completions and graph rigidity (English)
- New search for: Laurent, M.
- New search for: Laurent, M.
- New search for: Liebling, T. M.
- New search for: De Werra, D.
In:
Lectures on Mathematical Programming ismp97
1/3
;
255-284
;
1997
-
ISSN:
- Article (Journal) / Print
-
Title:Cuts, matrix completions and graph rigidity
-
Contributors:
-
Published in:Lectures on Mathematical Programming ismp97 , 1/3 ; 255-284MATHEMATICAL PROGRAMMING ; 79, 1/3 ; 255-284
-
Publisher:
- New search for: ELSEVIER
-
Publication date:1997-01-01
-
Size:30 pages
-
ISSN:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: 519.7
- Further information on Dewey Decimal Classification
-
Classification:
DDC: 519.7 -
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents – Volume 79, Issue 1/3
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 3
-
How to deal with the unbounded in optimization: Theory and algorithmsAuslender, A. et al. | 1997
- 19
-
A modified lift-and-project procedureBalas, E. et al. | 1997
- 33
-
Measure concentration in optimizationBarvinok, A. et al. | 1997
- 55
-
Efficiently solvable special cases of hard combinatorial optimization problemsBurkard, R. E. et al. | 1997
- 71
-
Two applications of the Divide & Conquer principle in the molecular sciencesBrinkmann, G. / Dress, A. W. M. / Perrey, S. W. / Stoye, J. et al. | 1997
- 99
-
Interactions between nonlinear programming and modeling systemsDrud, A. S. et al. | 1997
- 125
-
Algorithms for railway crew managementCaprara, A. / Fischetti, M. / Toth, P. / Vigo, D. / Guida, P. L. et al. | 1997
- 143
-
Semidefinite programming in combinatorial optimizationGoemans, M. X. et al. | 1997
- 163
-
Logical analysis of numerical dataBoros, E. / Hammer, P. L. / Ibaraki, T. / Kogan, A. et al. | 1997
- 191
-
Cluster analysis and mathematical programmingHansen, P. / Jaumard, B. et al. | 1997
- 217
-
Linear programming, the simplex algorithm and simple polytopesKalai, G. et al. | 1997
- 235
-
Exploiting sparsity in primal-dual interior-point methods for semidefinite programmingFujisawa, K. / Kojima, M. / Nakata, K. et al. | 1997
- 255
-
Cuts, matrix completions and graph rigidityLaurent, M. et al. | 1997
- 285
-
Interior-point methods: An old and new approach to nonlinear programmingNesterov, Y. et al. | 1997
- 299
-
Error bounds in mathematical programmingPang, J.-S. et al. | 1997
- 333
-
Decomposition methods in stochastic programmingRuszczynski, A. et al. | 1997
- 355
-
Test sets for integer programsScarf, H. E. et al. | 1997
- 369
-
Criss-cross methods: A fresh view on pivot algorithmsFukuda, K. / Terlaky, T. et al. | 1997
- 397
-
Recent progress in unconstrained nonlinear optimization without derivativesConn, A. R. / Scheinberg, K. / Toint, P. L. et al. | 1997
- 415
-
Discrete optimization in public rail transportBussieck, M. R. / Winter, T. / Zimmermann, U. T. et al. | 1997
- 445
-
Free material optimization via mathematical programmingZowe, J. / Kocvara, M. / Bendsoee, M. P. et al. | 1997