Mathematical Programming Essays in Honor of George B. Dantzig Part II - Mathematical Programming Studies
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642009204, 9783642009211

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the quadratic programming algorithm of Goldfarb and Idnani

Mathematical Programming Essays in Honor of George B. Dantzig Part II - Mathematical Programming Studies ◽

10.1007/bfb0121074 ◽

1985 ◽

pp. 46-61 ◽

Cited By ~ 81

Author(s):

M. J. D. Powell

Keyword(s):

Quadratic Programming ◽

Programming Algorithm

Download Full-text

Linear complementarity problems solvable by a polynomially bounded pivoting algorithm

Mathematical Programming Essays in Honor of George B. Dantzig Part II - Mathematical Programming Studies ◽

10.1007/bfb0121072 ◽

1985 ◽

pp. 13-27 ◽

Cited By ~ 15

Author(s):

J. S. Pang ◽

R. Chandrasekaran

Keyword(s):

Complementarity Problems ◽

Linear Complementarity Problems ◽

Linear Complementarity ◽

Pivoting Algorithm

Download Full-text

Line-sum-symmetric scalings of square nonnegative matrices

Mathematical Programming Essays in Honor of George B. Dantzig Part II - Mathematical Programming Studies ◽

10.1007/bfb0121080 ◽

1985 ◽

pp. 124-141 ◽

Cited By ~ 28

Author(s):

B. Curtis Eaves ◽

Alan J. Hoffman ◽

Uriel G. Rothblum ◽

Hans Schneider

Keyword(s):

Nonnegative Matrices

Download Full-text

Critical path planning under uncertainty

Mathematical Programming Essays in Honor of George B. Dantzig Part II - Mathematical Programming Studies ◽

10.1007/bfb0121082 ◽

1985 ◽

pp. 164-171 ◽

Cited By ~ 42

Author(s):

Richard D. Wollmer

Keyword(s):

Path Planning ◽

Critical Path ◽

Planning Under Uncertainty

Download Full-text

The use of hypothetical points in numerical optimization

Mathematical Programming Essays in Honor of George B. Dantzig Part II - Mathematical Programming Studies ◽

10.1007/bfb0121073 ◽

1985 ◽

pp. 28-45

Author(s):

E. M. L. Beale ◽

O. S. Brooker

Keyword(s):

Numerical Optimization

Download Full-text

Using deep cuts in an ellipsoid algorithm for nonlinear programming

Mathematical Programming Essays in Honor of George B. Dantzig Part II - Mathematical Programming Studies ◽

10.1007/bfb0121078 ◽

1985 ◽

pp. 93-107 ◽

Cited By ~ 11

Author(s):

Stephen T. Dziuban ◽

J. G. Ecker ◽

Michael Kupferschmid

Keyword(s):

Nonlinear Programming ◽

Ellipsoid Algorithm ◽

Deep Cuts

Download Full-text

Minimizing a unimodal function of two integer variables

Mathematical Programming Essays in Honor of George B. Dantzig Part II - Mathematical Programming Studies ◽

10.1007/bfb0121076 ◽

1985 ◽

pp. 76-87 ◽

Cited By ~ 3

Author(s):

Alan J. Hoffman ◽

Philip Wolfe

Keyword(s):

Unimodal Function ◽

Integer Variables

Download Full-text

On the principle of monotone likelihood and log-linear models

Mathematical Programming Essays in Honor of George B. Dantzig Part II - Mathematical Programming Studies ◽

10.1007/bfb0121079 ◽

1985 ◽

pp. 108-123 ◽

Cited By ~ 5

Author(s):

Sven Erlander

Keyword(s):

Linear Models ◽

Log Linear

Download Full-text

Existence and characterization of minima of concave functions on unbounded convex sets

Mathematical Programming Essays in Honor of George B. Dantzig Part II - Mathematical Programming Studies ◽

10.1007/bfb0121077 ◽

1985 ◽

pp. 88-92 ◽

Cited By ~ 2

Author(s):

Arthur F. Veinott

Keyword(s):

Convex Sets ◽

Concave Functions ◽

Unbounded Convex

Download Full-text

Simple computable bounds for solutions of linear complementarity problems and linear programs

Mathematical Programming Essays in Honor of George B. Dantzig Part II - Mathematical Programming Studies ◽

10.1007/bfb0121071 ◽

1985 ◽

pp. 1-12 ◽

Cited By ~ 17

Author(s):

O. L. Mangasarian

Keyword(s):

Complementarity Problems ◽

Linear Complementarity Problems ◽

Linear Complementarity ◽

Linear Programs

Download Full-text

Mathematical Programming Essays in Honor of George B. Dantzig Part II - Mathematical Programming StudiesLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

On the quadratic programming algorithm of Goldfarb and Idnani

Linear complementarity problems solvable by a polynomially bounded pivoting algorithm

Line-sum-symmetric scalings of square nonnegative matrices

Critical path planning under uncertainty

The use of hypothetical points in numerical optimization

Using deep cuts in an ellipsoid algorithm for nonlinear programming

Minimizing a unimodal function of two integer variables

On the principle of monotone likelihood and log-linear models

Existence and characterization of minima of concave functions on unbounded convex sets

Simple computable bounds for solutions of linear complementarity problems and linear programs

Mathematical Programming Essays in Honor of George B. Dantzig Part II - Mathematical Programming Studies
Latest Publications