Nonlinear biobjective optimization: improving the upper envelope using feasible line segments (Q2022248): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-021-00991-7 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: ibexMop / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-021-00991-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3127384426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trade-off analysis approach for interactive nonlinear multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-convex multi-objective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interval algorithm for multi-objective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining an outer approximation of the efficient set of nonlinear biobjective problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: First order rejection tests for multiple-objective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2713275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3860434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounding in inner regions for global optimization under inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration of AI and OR techniques in contraint programming for combinatorial optimzation problems. 9th international conference, CPAIOR 2012, Nantes, France, May 28--June 1, 2012. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Safe Global Constraints for Handling Numerical Constraint Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reliable affine relaxation method for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable minimax parameter estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractor programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive Interval Disjunction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdivision Direction Selection in Interval Methods for Global Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5733025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-021-00991-7 / rank
 
Normal rank

Latest revision as of 19:19, 16 December 2024

scientific article
Language Label Description Also known as
English
Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
scientific article

    Statements

    Nonlinear biobjective optimization: improving the upper envelope using feasible line segments (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 April 2021
    0 references
    interval methods
    0 references
    branch \& bound
    0 references
    multiobjective optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers