Optimization problems with evidential linear objective

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Inclusion-exclusion principle for belief functions
Constrained optimization problems under uncertainty with coherent lower previsions
On combinatorial optimization problems on matroids with uncertain weights
Discrete optimization with interval data. Minmax regret and fuzzy approach
Independence concepts in evidence theory
Decision making under uncertainty using imprecise probabilities
Minimax regret solution to linear programming problems with an interval objective function
On the robust shortest path problem.
The capacitated vehicle routing problem with evidential demands
Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
Shortest path problems with partial information: Models and algorithms for detecting dominance
The vehicle routing problem with time windows and evidential service and travel times: a recourse model
Decision-making with belief functions: a review
An exact method for the biobjective shortest path problem for large-scale road networks
Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming
Belief functions and statistical inference
Near-shortest and K-shortest simple paths
Introduction to Imprecise Probabilities
Linear programming. Foundations and extensions
The robust spanning tree problem with interval data
The computational complexity of the criticality problems in a network with interval activity times
On modelling and solving the shortest path problem with evidential weights

This page was built for publication: Optimization problems with evidential linear objective