A note on bicriterion programming (Q3040940): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56324196, #quickstatements; #temporary_batch_1705097318925
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector maximization with two objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Bicriterion Mathematical Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Parametric Solution of a Class of Nonconvex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding the Maxima of a Set of Vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound to Finding Convex Hulls / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02591909 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094976929 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:42, 30 July 2024

scientific article
Language Label Description Also known as
English
A note on bicriterion programming
scientific article

    Statements

    A note on bicriterion programming (English)
    0 references
    1983
    0 references
    complexity
    0 references
    bicriterion vector maximum problem
    0 references
    separable objectives
    0 references
    complete enumeration
    0 references

    Identifiers