Computing compromise sets in polyhedral framework (Q1585508): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the monotonicity of the compromise set in multicriteria problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some New Results on Compromise Solutions for Group Decision Problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0893-9659(00)00039-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972373058 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:00, 30 July 2024

scientific article
Language Label Description Also known as
English
Computing compromise sets in polyhedral framework
scientific article

    Statements

    Computing compromise sets in polyhedral framework (English)
    0 references
    0 references
    16 November 2000
    0 references
    compromise programming
    0 references
    convexity
    0 references
    \(p\)-norms
    0 references
    compromise set
    0 references
    multicriteria problems
    0 references
    monotonicity
    0 references

    Identifiers