default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 6
Volume 6, Number 1, July 1996
- B. N. Khoury, Panos M. Pardalos:
A heuristic for the Steiner problem in graphs. 5-14 - H. Paul Williams:
Constructing the value function for an Integer Linear Programme over a Cone. 15-26 - Yves Lucet:
A fast computational algorithm for the Legendre-Fenchel transform. 27-57 - P. Patrick Wang, Der-San Chen:
Continuous optimization by a variant of simulated annealing. 59-71 - A. K. Sarkar, P. K. Chaudhuri:
Solution of an equiweighted minimax location problem on a hemisphere. 73-82 - J. J. Bisschop, Robert Fourer:
New constructs for the description of combinatorial optimization problems in algebraic modeling languages. 83-116
Volume 6, Number 2, September 1996
- Michael C. Ferris, Stefano Lucidi, Massimo Roma:
Nonmonotone curvilinear line search methods for unconstrained optimization. 117-136 - Jacek Gondzio
:
Multiple centrality corrections in a primal-dual method for linear programming. 137-156 - Amr S. El-Bakry, Richard A. Tapia, Yin Zhang:
On the convergence rate of Newton interior-point methods in the absence of strict complementarity. 157-167 - Christopher John Price, Ian D. Coope:
Numerical experiments in semi-infinite programming. 169-189 - Stefan Chanas, Przemyslaw Kobylanski:
A new heuristic algorithm solving the linear ordering problem. 191-205
Volume 6, Number 3, November 1996
- Achim Bachem, Winfried Hochstättler, Barthel Steckemetz, A. Volmer:
Computational experience with general equilibrium problems. 213-225 - Stephan Dempe, H. Schmidt:
On an algorithm solving two-level programming problems with nonunique lower level solutions. 227-249 - Olof Damberg, Sverre Storøy, Tor Sørevik:
A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem. 251-272 - Bah-Hwee Gwee, M. H. Lim:
Polyominoes tiling by a genetic algorithm. 273-291 - Naum Z. Shor, Yu. V. Voitishin, V. M. Glushkov:
Using dual network bounds in algorithms for solving generalized set packing partitioning problems. 293-303
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 2025-12-04 01:26 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:
