default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 8
Volume 8, Number 1, July 1997
- Levent Tunçel, Michael J. Todd:
On the Interplay among Entropy, Variable Metrics and Potential Functions in Interior-Point Algorithms. 5-19 - Dan Butnariu, Yair Censor
, Simeon Reich:
Iterative Averaging of Entropic Projections for Solving Stochastic Convex Feasibility Problems. 21-39 - Malgorzata M. Wiecek, Hong Zhang:
A Parallel Algorithm for Multiple Objective Linear Programs. 41-56 - Jeffery L. Kennington, Riad A. K. Mohamed:
Recovery from Numerical Instability during Basis Reinversion. 57-71 - Erik Hendrickson, Irena Lasiecka:
Convergence of Numerical Algorithms for the Approximations to Riccati Equations Arising in Smart Material Acoustic Structure Interactions. 73-101
Volume 8, Number 2, September 1997
- Jens Clausen, Michael Perregaard:
Solving Large Quadratic Assignment Problems in Parallel. 111-127 - Aubrey B. Poore, Alexander J. Robertson III:
A New Lagrangian Relaxation Based Algorithm for a Class of Multidimensional Assignment Problems. 129-150 - Fred W. Glover, Hanif D. Sherali, Youngho Lee:
Generating Cuts from Surrogate Constraint Analysis for Zero-One and Multiple Choice Programming. 151-172 - Nestor F. Michelena, Panos Y. Papalambros:
A Hypergraph Framework for Optimal Model-Based Decomposition of Design Problems. 173-196 - Lucio Bianco, Paolo Dell'Olmo, Stefano Giordani:
An Optimal Algorithm to Find the Jump Number of Partially Ordered Sets. 197-210
Volume 8, Number 3, November 1997
- B. Smith, John L. Nazareth:
Metric-Based Symmetric Rank-One Updates. 219-244 - Renato D. C. Monteiro, Fangjun Zhou:
On Superlinear Convergence of Infeasible Interior-Point Algorithms for Linearly Constrained Convex Programs. 245-262 - Nan Zhu, Kevin A. Broughan:
A Note on Reducing the Number of Variables in Integer Programming Problems. 263-272 - Mark S. Gockenbach, Anthony J. Kearsley, William W. Symes:
An Infeasible Point Method for Minimizing the Lennard-Jones Potential. 273-286 - Jeffery L. Kennington, Farin Mohammadi:
A Truncated Exponential Algorithm for the Lightly Constrained Assignment Problem. 287-299
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 2026-05-27 02:08 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:
