default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 62
Volume 62, 1993
- Wolfgang W. Bein, Peter Brucker, Alan J. Hoffman:
Series parallel composition of greedy linear programming problems. 1-14 - Robert Fourer, Sanjay Mehrotra:
Solving symmetric indefinite systems in an interior-point method for linear programming. 15-39 - S. Kingsley Gnanendran, James K. Ho:
Load balancing in the parallel optimization of block-angular linear programs. 41-67 - Dorit S. Hochbaum, Nimrod Megiddo, Joseph Naor, Arie Tamir:
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. 69-83 - Tohru Ishihara, Masakazu Kojima:
On the big Mu in the affine scaling algorithm. 85-93 - Kim L. Jones, Irvin Lustig
, Judith M. Farvolden, Warren B. Powell:
Multicommodity network flows: The impact of formulation on decomposition. 95-117 - Shinji Mizuno, Atsushi Nagasawa:
A primal-dual affine-scaling potential-reduction algorithm for linear programming. 119-131 - Ellis L. Johnson, Anuj Mehrotra, George L. Nemhauser:
Min-cut clustering. 133-151 - M. J. D. Powell:
On the number of iterations of Karmarkar's algorithm for linear programming. 153-197 - Alan J. Hoffman, Arthur F. Veinott Jr.:
Staircase transportation problems with superadditive rewards and cumulative capacities. 199-213 - Stein W. Wallace, Roger J.-B. Wets:
The facets of the polyhedral set determined by the Gale-Hoffman inequalities. 215-222 - Allen A. Goldstein:
A global Newton method II: Analytic centers. 223-237 - Phan Thien Thach, Hiroshi Konno:
A generlized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems. 239-260 - Rafael Correa, Claude Lemaréchal:
Convergence of some algorithms for convex minimization. 261-275 - Olvi L. Mangasarian, Mikhail V. Solodov:
Nonlinear complementarity as unconstrained and constrained minimization. 277-297 - Robert Mifflin, Jean-Jacques Strodiot:
A rapidly convergent five-point algorithm for univariate minimization. 299-319 - Michael L. Overton, Robert S. Womersley:
Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices. 321-357 - Jong-Shi Pang:
A degree-theoretic approach to parametric nonsmooth equations with multivalued perturbed solution sets. 359-383 - Elijah Polak:
On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems. 385-414 - Stephen M. Robinson:
Nonsingularity and symmetry for linear normal maps. 415-425 - Dan Feng, Paul D. Frank, Robert B. Schnabel:
Local convergence analysis of tensor methods for nonlinear equations. 427-459 - David B. Shmoys, Éva Tardos:
An approximation algorithm for the generalized assignment problem. 461-474 - Arie Tamir:
The least element property of center location on tree networks with applications to distance and precedence constrained problems. 475-496 - Sanjay Mehrotra, Yinyu Ye:
Finding an interior point in the optimal face of linear programs. 497-515 - Kurt M. Anstreicher:
Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming. 517-535 - Yinyu Ye, Kurt M. Anstreicher:
On quadratic and O(qudar root(n) * L) convergence of a predictor-corrector algorithm for LCP. 537-551 - B. Curtis Eaves:
Pivoting to normalize a basic matrix. 553-556 - Charles Delorme, Svatopluk Poljak:
Laplacian eigenvalues and the maximum cut problem. 557-574 - Gabriele Danninger, Immanuel M. Bomze:
Using copositivity for global optimality criteria in concave quadratic programming problems. 575-580
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-09-21 01:33 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:
