An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming (Q3468895): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Existence of efficient solutions for vector maximization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector maximization with two objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for solving a class of nonlinear integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Methods for Pure Nonlinear Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Overview of Techniques for Solving Multiobjective Mathematical Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On efficient sets in vector maximum problems - A brief survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Bicriterion Mathematical Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper efficiency and the theory of vector maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applied Bi-objective programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:21, 20 June 2024

scientific article
Language Label Description Also known as
English
An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references