Constraint ordinal optimization (Q1810456)

From MaRDI portal

Revision as of 16:21, 5 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Constraint ordinal optimization	scientific article

Statements

scholarly article

0 references

Constraint ordinal optimization (English)

0 references

0 references

Information Sciences

0 references

publication date

9 June 2003

0 references

zbMATH Keywords

Optimization

0 references

Simulation

0 references

Ordinal optimization

0 references

Constraint optimization

0 references

MaRDI profile type

MaRDI publication profile

0 references

Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems

0 references

An ordinal optimization approach to optimal control problems

0 references

0 references

A memetic algorithm for the total tardiness single machine scheduling problem

0 references

Using a hybrid of exact and genetic algorithms to design survivable networks

0 references

Tabu Search—Part I

0 references

Ordinal optimization of DEDS

0 references

An explanation of ordinal optimization: Soft computing for hard problems

0 references

0 references

Optimization by Simulated Annealing

0 references

Universal alignment probabilities and subset selection for ordinal optimization

0 references

Explanation of goal softening in ordinal optimization

0 references

0 references

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0020-0255(02)00296-7

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1810456

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1810456&oldid=34342413"