Displaying similar documents to “On optimal route planning evading cubes in the three space.”

An optimal path planning problem for heterogeneous multi-vehicle systems

Martin Klaučo, Slavomír Blažek, Michal Kvasnica (2016)

International Journal of Applied Mathematics and Computer Science

Similarity:

A path planning problem for a heterogeneous vehicle is considered. Such a vehicle consists of two parts which have the ability to move individually, but one of them has a shorter range and is therefore required to keep in a close distance to the main vehicle. The objective is to devise an optimal path of minimal length under the condition that at least one part of the heterogeneous system visits all desired waypoints exactly once. Two versions of the problem are considered. One assumes...

Macroscopic non-uniqueness and transversal fluctuation in optimal random sequence alignment

Saba Amsalu, Heinrich Matzinger, Serguei Popov (2007)

ESAIM: Probability and Statistics

Similarity:

We investigate the optimal alignment of two independent random sequences of length . We provide a polynomial lower bound for the probability of the optimal alignment to be macroscopically non-unique. We furthermore establish a connection between the transversal fluctuation and macroscopic non-uniqueness.

On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems

Diptesh Ghosh, Gerard Sierksma (2003)

Applicationes Mathematicae

Similarity:

This paper studies the complexity of sensitivity analysis for optimal and ε-optimal solutions to general 0-1 combinatorial optimization problems with min-max objectives. Van Hoesel and Wagelmans [9] have studied the complexity of sensitivity analysis of optimal and ε-optimal solutions to min-sum problems, and Ramaswamy et al. [17] the complexity of sensitivity analysis of optimal solutions to min-max problems. We show that under some mild assumptions the sensitivity analysis of ε-optimal...

Optimal streams of premiums in multiperiod credibility models

L. Gajek, P. Miś, J. Słowińska (2007)

Applicationes Mathematicae

Similarity:

Optimal arrangement of a stream of insurance premiums for a multiperiod insurance policy is considered. In order to satisfy solvency requirements we assume that a weak Axiom of Solvency is satisfied. Then two optimization problems are solved: finding a stream of net premiums that approximates optimally 1) future claims, or 2) "anticipating premiums". It is shown that the resulting optimal streams of premiums enable differentiating between policyholders much more quickly than one-period...

Discrete time optimal dividend problem with constant premium and exponentially distributed claims

Dariusz Socha (2014)

Applicationes Mathematicae

Similarity:

An optimal dividend problem is studied consisting in maximisation of expected discounted dividend payments until ruin time. A solution of this problem for constant premium d and exponentially distributed claims is presented. It is shown that an optimal policy is a barrier policy. Moreover, an analytic way to solve this problem is sketched.