Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 13
Volume 13, Number 1, 1977
- Richard S. Barr, Fred W. Glover, Darwin Klingman:
The alternating basis algorithm for assignment problems. 1-13 - Allen A. Goldstein:
Optimization of lipschitz continuous functions. 14-22 - Arthur M. Geoffrion:
Objective function approximations in mathematical programming. 23-37 - C. C. Agunwamba:
Optimality condition: Constraint regularization. 38-48 - Balder Von Hohenbalken:
Simplicial decomposition in nonlinear programming algorithms. 49-68 - Manuel J. Carrillo:
A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron. 69-80 - Arie Tamir:
Ergodicity and symmetric mathematical programs. 81-87 - Darald J. Hartfiel, Guy L. Curry:
On optimizing certain nonlinear convex functions which are partially defined by a simulation process. 88-93 - Donald Goldfarb:
Generating conjugate directions without line searches using factorized variable metric updating formulas. 94-110 - Garth P. McCormick:
A modification of Armijo's step-size rule for negative curvature. 111-115 - Delbert Ray Fulkerson, Gary C. Harding:
Maximizing the minimum source-sink path subject to a budget constraint. 116-118 - Gabriel R. Bitran:
Linear multiple objective programs with zero-one variables. 121-139 - S. R. K. Dutta, Mathukumalli Vidyasagar:
New algorithms for constrained minimax optimization. 140-155 - Madabhushi Raghavachari:
A geometric programming approach to the Van der Waerden conjecture on doubly stochastic matrices. 156-166 - M. C. Biggs, M. A. Laughton:
Optimal electric power scheduling: A large nonlinear programming test problem solved by recursive quadratic programming. 167-182 - Jonathan M. Borwein
:
Multivalued convexity and optimization: A unified approach to inequality and equality constraints. 183-199 - John J. Dinkel, William H. Elliott, Gary A. Kochenberger:
Computational aspects of cutting-plane algorithms for geometric programming problems. 200-220 - Mokhtar S. Bazaraa, Jamie J. Goode:
The traveling salesman problem: A duality approach. 221-237 - Johannes Bisschop, Alexander Meeraus:
Matrix augmentation and partitioning in the updating of the basis inverse. 241-254 - Hiroaki Ishii, Toshihide Ibaraki, Hisashi Mine:
Fractional knapsack problems. 255-271 - Donald Goldfarb:
On the Bartels - Golub decomposition for linear programming bases. 272-279 - Michel Bénichou, Jean-Michel Gauthier, Gerard Hentges, Gerard Ribière:
The efficient solution of large-scale linear programming problems - some algorithmic techniques and computational results. 280-322 - James R. Evans, John J. Jarvis, Richard A. Duke:
Graphic matroids and the multicommodity transportation problem. 323-328 - Jean-Louis Goffin:
On convergence rates of subgradient optimization methods. 329-347 - Markku Kallio, Evan L. Porteus:
Decomposition of arborescent linear programs. 348-356 - Johan Philip:
Vector maximization at a degenerate vertex. 357-359 - Jong-Shi Pang:
A note on an open problem in linear complementarity. 360-363 - Jean-Pierre Crouzeix:
A relationship between the second derivatives of a convex function and of its conjugate. 364-365 - Philip Wolfe:
From the Secretariat of the Mathematical Programming Society. 366
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-22 20:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
