default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 14
Volume 14, Number 1, July 1999
- Olvi L. Mangasarian, Mikhail V. Solodov:
A Linearly Convergent Derivative-Free Descent Method for Strongly Monotone Complementarity Problems. 5-16 - J. Gondizo, Jean-Philippe Vial:
Warm Start and ε-Subgradients in a Cutting Plane Scheme for Block-Angular Linear Programs. 17-36 - Zdenek Dostál
, Ana Friedlander, Sandra A. Santos:
Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Equality Constraints. 37-53 - Donald Goldfarb, R. Polyak, Katya Scheinberg, I. Yuzefovich:
A Modified Barrier-Augmented Lagrangian Method for Constrained Minimization. 55-74 - Luc Pronzato, Henry P. Wynn, Anatoly A. Zhigljavsky:
Finite Sample Behaviour of an Ergodically Fast Line-Search Algorithm. 75-86 - Sjur Didrik Flåm:
Learning Equilibrium Play: A Myopic Approach. 87-102 - C. Mohan, Hung T. Nguyen:
A Controlled Random Search Technique Incorporating the Simulated Annealing Concept for Solving Integer and Mixed Integer Global Optimization Problems. 103-132 - Chuangyin Dang, Hans van Maaren:
An Arbitrary Starting Variable Dimension Algorithm for Computing an Integer Point of a Simplex. 133-155 - Marc Demange:
A Note on the Approximation of a Minimum-Weight Maximal Independent Set. 157-169
Volume 14, Number 2, September 1999
- John T. Betts, William P. Huffman:
Exploiting Sparsity in the Direct Transcription Method for Optimal Control. 179-201 - Bernd Baumann, Bernd Kost:
Topology Optimization of Trusses - Random Cost Method Versus Evolutionary Algorithms. 203-218 - Jeffery L. Kennington, V. S. S. Nair, M. H. Rahman:
Optimization Based Algorithms for Finding Minimal Cost Ring Covers in Survivable Networks. 219-230 - M. S. Hingst, Andrew T. Phillips:
A Performance Analysis of Appel's Algorithm for Performing Pairwise Calculations in a Many Particle System. 231-240 - Alfonso Mateos, Sixto Ríos-Insua, L. Prieto:
Computational Study of the Relationships Between Feasible and Efficient Sets and an Approximation. 241-260 - Saeid Mehrabian, Mohammad R. Alirezaee, Gholam Reza Jahanshahloo:
A Complete Efficiency Ranking of Decision Making Units in Data Envelopment Analysis. 261-266
Volume 14, Number 3, November 1999
- Hanif D. Sherali, Intesar Al-Loughani:
Solving Euclidean Distance Multifacility Location Problems Using Conjugate Subgradient and Line-Search Methods. 275-291 - Gongyun Zhao, Jie Sun:
On the Rate of Local Convergence of High-Order-Infeasible-Path-Following Algorithms for P*-Linear Complementarity Problems. 293-307 - Kim-Chuan Toh:
Primal-Dual Path-Following Algorithms for Determinant Maximization Problems With Linear Matrix Inequalities. 309-330 - Vera V. Kovacevic-Vujcic, Miroslav D. Asic:
Stabilization of Interior-Point Methods for Linear Programming. 331-346 - Takahito Kuno, Hiroshi Konno, Akira Irie:
A Deterministic Approach to Linear Programs with Several Additional Multiplicative Constraints. 347-366 - Carlo Mannino, Egidio Stefanutti:
An Augmentation Algorithm for the Maximum Weighted Stable Set Problem. 367-381
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-12-29 01:15 CET 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:
