Computing upper and lower bounds in interval decision trees-Reference-Cited by-同舟云学术

Computing upper and lower bounds in interval decision trees

Published:2007-09 Issue:2 Volume:181 Page:808-816
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Danielson Mats,Ekenberg Love

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference44 articles.

1. The use of QR factorisation in sparse quadratic programming and backward error issues;Arioli;SIAM Journal on Matrix Analysis and Applications,2000

2. On minimizing a convex function subject to linear inequalities;Beale;Journal of the Royal Statistical Society, (Series B),1955

3. A comparative study of large-scale non-linear optimization algorithms;Benson,2001

4. A quadratic programming algorithm using conjugate search directions;Benveniste;Mathematical Programming,1979

5. Basis and partition identification for quadratic programming and linear complementarity problems;Berkelaar;Mathematical Programming,1999

Cited by 47 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Upper Performance Limits and Distribution Invariance for Surrogate Weights in MCDA;Lecture Notes in Business Information Processing;2024

2. A risk-based decision framework for policy analysis of societal pandemic effects;Frontiers in Public Health;2023-02-17

3. Automatically Generated Weight Methods for Human and Machine Decision-Making;Advances and Trends in Artificial Intelligence. Theory and Applications;2023

4. Stochastic decision tree acceptability analysis with uncertain state probability;Journal of the Operational Research Society;2022-12-28

5. A Multi-Criteria Approach to Decision Making in Broadband Technology Selection;Group Decision and Negotiation;2022-01-06