Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Algorithms constructing a representive vector criterion for a binary preference relation

From MaRDI portal
Publication:1343006
Jump to:navigation, search

DOI10.1007/BF01128292zbMath0825.90030OpenAlexW2071877442MaRDI QIDQ1343006

S. A. Eroshov

Publication date: 16 January 1995

Published in: Computational Mathematics and Modeling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01128292


Mathematics Subject Classification ID

Individual preferences (91B08)




Cites Work

  • On the complexity of posets
  • A decomposition theorem for partially ordered sets
  • Formation of a vector criterion on the basis of a binary preference relation
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1343006&oldid=13476945"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 14:36.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki