A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems (Q1754103)

From MaRDI portal
Revision as of 08:23, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
scientific article

    Statements

    A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems (English)
    0 references
    0 references
    0 references
    30 May 2018
    0 references
    multiple objective programming
    0 references
    integer programming
    0 references

    Identifiers