Last searches
Results for *
Displaying results 1 to 21 of 21.
-
Optimum turn-restricted paths, nested compatibility, and optimum convex polygons
-
Sequential testing of n-outof-n systems
precedence theorems and exact methods -
Fast Upper-Envelope Scan for Discrete-Continuous Dynamic Programming
-
The art of temporal approximation
an investigation into numerical solutions to discrete & continuous-time problems in economics -
Disequilibrium play in tennis
-
A dedicated pricing algorithm to solve a large family of nurse scheduling problems with branch-and-price
-
Optimal additional voluntary contribution in DC pension schemes to manage inadequacy risk
-
Dynamic programming for valuing options embedded in corporate bonds
-
Resource loading with time windows
-
Exact and inexact scheduling algorithms for multiple earth observation satellites under uncertainties of clouds
-
Sustainability of pension schemes
building a smooth automatic balance mechanism with an application to the US social security -
Modeling poset convex subsets
-
A fast upper envelope scan method for discrete-continuous dynamic programming
-
Crowdshipping: an open VRP variant with stochastic destinations
-
Bellman filtering for state-space models
-
Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
-
Exploiting symmetry in high-dimensional dynamic programming
-
Disequilibrium play in tennis
-
A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem
-
Pricing climate risk
-
Smart cap