| A robust ordered weighted averaging loss model for portfolio optimization |
|
| An orness based decision support model to aggregate ordered costs |
|
| A robust optimization model for distribution network design under a mixed integer set of scenarios |
|
| A relative robust approach on expected returns with bounded CVaR for portfolio selection |
|
| An optimization model for line planning and timetabling in automated urban metro subway networks. A case study |
|
| Robust minmax regret combinatorial optimization problems with a resource–dependent uncertainty polyhedron of scenarios |
|
| A minmax regret version of the time-dependent shortest path problem |
|
| Minmax regret combinatorial optimization problems with investments |
|
| A minimum expected regret model for the shortest path problem with solution-dependent probability distributions |
|
| A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines |
|
| A Minmax Regret Linear Regression Model Under Uncertainty in the Dependent Variable |
|
| A minmax regret median problem on a tree under uncertain locations of the demand points |
|
| On a constant factor approximation for minmax regret problems using a symmetry point scenario |
|
| A 2-approximation for minmax regret problems via a mid-point scenario optimal solution |
|
| A linear optimization problem to derive relative weights using an interval judgement matrix |
|
| A minmax regret approach to the critical path method with task interval times |
|
| C cells evolve at the same rhythm as follicular cells when thyroidal status changes in rats |
|
| A note on the minmax regret centdian location on trees |
|
| Minmax regret location-allocation problem on a network under uncertainty |
|
| A Branch and Bound algorithm for the minimax regret spanning arborescence |
|
| Minimax regret spanning arborescences under uncertain costs |
|
| An HMM for detecting spam mail |
|
| Inferring efficient weights from pairwise comparison matrices |
|
| On the complexity of the continuous unbounded knapsack problem with uncertain coefficients |
|
| An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion |
|
| Mean utility in the assurance region model |
|
| A fractional model for locating semi-desirable facilities on networks |
|
| Finding GM-estimators with global optimization techniques |
|
| Finding the principal points of a random variable |
|
| Admission policies in loss queueing models with heterogeneous arrivals |
|
| Semi-obnoxious location models: A global optimization approach |
|
| Simpson points in planar problems with locational constraints. The round-norm case |
|
| Simpson points in planar problems with locational constraints. The polyhedral-gauge case |
|
| THE GENERALIZED WEBER PROBLEM WITH EXPECTED DISTANCES |
|
| Multi-criteria analysis with partial information about the weighting coefficients |
|
| PARETO-OPTIMALITY IN LINEAR-REGRESSION |
|
| PLANAR POINT-OBJECTIVE LOCATION-PROBLEMS WITH NONCONVEX CONSTRAINTS - A GEOMETRICAL CONSTRUCTION |
|
| An axiomatic approach to the cent-dian criterion |
|
| Efficiency in Euclidean constrained location problems |
|
| A management tool for indicator-supported systems: A public health service application |
|
