A multi-run interactive method for bicriterion optimization problems
From MaRDI portal
Publication:3990312
DOI<115::AID-NAV3220390109>3.0.CO;2-7 10.1002/1520-6750(199202)39:1<115::AID-NAV3220390109>3.0.CO;2-7zbMath0825.90625OpenAlexW1997446291MaRDI QIDQ3990312
Publication date: 28 June 1992
Full work available at URL: https://doi.org/10.1002/1520-6750(199202)39:1<115::aid-nav3220390109>3.0.co;2-7
Integer programming (90C10) Management decision making, including multiple objectives (90B50) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (2)
Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem ⋮ Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
Cites Work
This page was built for publication: A multi-run interactive method for bicriterion optimization problems
