Publication | Closed Access

Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods

Mathematical ProgrammingNumerical AnalysisBranch-and-bound AlgorithmEfficient SetEngineeringContinuous OptimizationNonlinear ProgrammingOptimization ProblemSystems EngineeringNonlinear OptimizationInterval Branch-and-bound MethodsCombinatorial OptimizationComputational GeometryApproximation TheoryBranch And BoundOperations Research