Constraint ordinal optimization
type: Item
instance of: scholarly article
title: Constraint ordinal optimization
zbMATH Open document ID: 1031.90043
DOI: 10.1016/S0020-0255(02)00296-7
author: Yanyan Li
published in: Information Sciences
publication date: 2003-06-09T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 1924624
zbMATH Keywords: Optimization
zbMATH Keywords: Simulation
zbMATH Keywords: Ordinal optimization
zbMATH Keywords: Constraint optimization
MaRDI profile type: Publication
cites work: Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems
cites work: An ordinal optimization approach to optimal control problems
cites work: Q2766525
cites work: A memetic algorithm for the total tardiness single machine scheduling problem
cites work: Using a hybrid of exact and genetic algorithms to design survivable networks
cites work: Tabu Search—Part I
cites work: Ordinal optimization of DEDS
cites work: An explanation of ordinal optimization: Soft computing for hard problems
cites work: Q4079017
cites work: Optimization by Simulated Annealing
cites work: Universal alignment probabilities and subset selection for ordinal optimization
cites work: Explanation of goal softening in ordinal optimization
cites work: Q3683893
cites work: Q4546258
cites work: Q4354034
full work available at URL: s0020-0255(02)00296-7
OpenAlex ID: W1989521192
description: scientific article; zbMATH DE number 1924624