All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 2

Displaying 21 – 34 of 34

Showing per page

High-performance simulation-based algorithms for an alpine ski racer's trajectory optimization in heterogeneous computer systems

Roman Dębski (2014)

International Journal of Applied Mathematics and Computer Science

Effective, simulation-based trajectory optimization algorithms adapted to heterogeneous computers are studied with reference to the problem taken from alpine ski racing (the presented solution is probably the most general one published so far). The key idea behind these algorithms is to use a grid-based discretization scheme to transform the continuous optimization problem into a search problem over a specially constructed finite graph, and then to apply dynamic programming to find an approximation...

How much do approximate derivatives hurt filter methods?

Caroline Sainvitu (2009)

RAIRO - Operations Research

In this paper, we examine the influence of approximate first and/or second derivatives on the filter-trust-region algorithm designed for solving unconstrained nonlinear optimization problems and proposed by Gould, Sainvitu and Toint in [12]. Numerical experiments carried out on small-scaled unconstrained problems from the CUTEr collection describe the effect of the use of approximate derivatives on the robustness and the efficiency of the filter-trust-region method.

How to eliminate non-positive circuits in periodic scheduling: a proactive strategy based on shortest path equations

Sid-Ahmed-Ali Touati, Sébastien Briais, Karine Deschinkel (2013)

RAIRO - Operations Research - Recherche Opérationnelle

Usual periodic scheduling problems deal with precedence constraints having non-negative latencies. This seems a natural way for modelling scheduling problems, since task delays are generally non-negative quantities. However, in some cases, we need to consider edges latencies that do not only model task latencies, but model other precedence constraints. For instance in register optimisation problems devoted to optimising compilation, a generic machine or processor model can allow considering access...

Hybrid algorithms for fixed charge transportation problem

Nermin Kartli (2025)

Kybernetika

In this paper, we consider the fixed-cost transportation problem. This problem is known to be NP-hard. Therefore, various heuristic and metaheuristic approaches have been proposed to find an approximate optimal solution. In this paper, we propose three hybrid algorithms that combine the ideas of metaheuristic and heuristic approaches in different ways. Two of the proposed algorithms consist of the sequential implementation of metaheuristic and heuristic algorithms, while the third one is a full...

Hybrid flow-shop with adjustment

Jan Pelikán (2011)

Kybernetika

The subject of this paper is a flow-shop based on a case study aimed at the optimisation of ordering production jobs in mechanical engineering, in order to minimize the overall processing time, the makespan. The production jobs are processed by machines, and each job is assigned to a certain machine for technological reasons. Before processing a job, the machine has to be adjusted; there is only one adjuster who adjusts all of the machines. This problem is treated as a hybrid two-stage flow-shop:...

Hyperbolische Transformation konvexer Polyeder

Ralf Gollmer (1981)

Aplikace matematiky

Der Artikel beschäftigt sich mit einigen Eigenschaften von hyperbolischen, d. h. gebrochen-affinen, Transformationen, welche für die Bilder konvexer Polyeder bei solchen Transformationen von Bedeutung sind. Es wird eine explizite Darstellung des Bildes eines konvexen Polyeders durch Ecken und Kanten des Urbildpolyeders gewonnen, die Konvexität des Bildes und das Bild des relativen Inneren einer konvexen Menge untersucht.

Currently displaying 21 – 34 of 34

Previous Page 2