An explanation of ordinal optimization: Soft computing for hard problems
- 28 February 1999
- journal article
- Published by Elsevier BV in Information Sciences
- Vol. 113 (3-4), 169-192
- https://doi.org/10.1016/s0020-0255(98)10056-7
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Rates of Convergence of Ordinal Comparison for Dependent Discrete Event Dynamic SystemsJournal of Optimization Theory and Applications, 1997
- Universal Alignment Probabilities and Subset Selection for Ordinal OptimizationJournal of Optimization Theory and Applications, 1997
- SIMD parallel discrete-event dynamic system simulationIEEE Transactions on Control Systems Technology, 1997
- Convergence properties of ordinal comparison in the simulation of discrete event dynamic systemsJournal of Optimization Theory and Applications, 1996
- Efficient algorithm for virtual topology design in multihop lightwave networksIEEE/ACM Transactions on Networking, 1994
- Heuristics, rules of thumb, and the 80/20 propositionIEEE Transactions on Automatic Control, 1994