On complete and quasi-complete two-criteria optimization problems on graphs (Q1795505): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q129792152, #quickstatements; #temporary_batch_1729684397485
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10559-018-0040-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2803565429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3294638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the set of alternatives in discrete multicriterion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of discrete multicriteria problems / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129792152 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:04, 23 October 2024

scientific article
Language Label Description Also known as
English
On complete and quasi-complete two-criteria optimization problems on graphs
scientific article

    Statements

    On complete and quasi-complete two-criteria optimization problems on graphs (English)
    0 references
    0 references
    0 references
    16 October 2018
    0 references
    multicriteria optimization
    0 references
    vector optimization
    0 references
    Pareto set
    0 references
    complete set of alternatives
    0 references
    complete problem
    0 references
    quasi-complete problem
    0 references

    Identifiers