Filters
Computing Near-Optimal Solutions to the Network Steiner Tree Problem Using Approximate and Heuristic Techniques
approximate and deterministic heuristic methods with stochastic heuristic techniques.
BB - Aplikovaná statistika, operační výzkum
- 2001 •
- D
Rok uplatnění
D - Stať ve sborníku
Scenario Generation And Analysis by Heuristic Algorithms
The main purpose of this paper is to present how to use heuristic approaches, especially genetic algorithms, to a scenario manipulation in two-stage stochastic programming. The proposed technique is implemented in C++ and G...
JC - Počítačový hardware a software
- 2007 •
- D
Rok uplatnění
D - Stať ve sborníku
Stochastic Heuristic Techniques for Scheduling Job Shops
Job-shop scheduling problems belong to the class of NP-hard problems and therefore exact solution methods can be used only for very simple cases. This paper focuses on solving this problem by means of stochastic heuristic methods (s...
BB - Aplikovaná statistika, operační výzkum
- 1999 •
- D
Rok uplatnění
D - Stať ve sborníku
Stochastic Heuristic Techniques for Scheduling Job Shops
Job-shop scheduling problems belong to the class of NP-hard problems and therefore exact solution methods can be used only for very simple cases. This paper focuses on solving this problem by means of stochastic heuristic methods (s...
JC - Počítačový hardware a software
- 1999 •
- D
Rok uplatnění
D - Stať ve sborníku
Scheduling Job Shops Using Genetic Algorithms and Local Search Framework
This paper provides a comparison of the application of stochastic heuristic techniques (genetic algorithms, simulated annealing and tabu search) to job shop scheduling. It presents computational results achieved for three t...
BB - Aplikovaná statistika, operační výzkum
- 1999 •
- D
Rok uplatnění
D - Stať ve sborníku
The Formal Framework for DOP
This paper present basic principles of the distributed modelling approach to optimization model design.
BD - Teorie informace
- 2008 •
- D
Rok uplatnění
D - Stať ve sborníku
Flow Shop Scheduling Using Stochastic Heuristických Methods
In this paper, we apply three heuristic techniques (simulated annealing, tabu-search, and genetic algorithm) to permutation flowshop scheduling problem with the objective minimizing makespan. Solving some benchmark problems, we exam...
JC - Počítačový hardware a software
- 1999 •
- D
Rok uplatnění
D - Stať ve sborníku
The Worst Case Analysis by Heuristic Algorithms
The paper is focused on the extreme set of scenarios in stochastic programming. The special genetic algorithm heuristically finds these worst cases....
BA - Obecná matematika
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
A Simulated Annealing Approach for Integer Maximal Multicommodity Flow Problem
In this paper the Integer Maximal Multicommodity Flow Problem is discussed. It belongs to the class of NP-hard combinatorial problems and thus for large scale instances must be solved by approximation or heuristic techniques. Many <...
BB - Aplikovaná statistika, operační výzkum
- 2004 •
- D
Rok uplatnění
D - Stať ve sborníku
Stochastic Heuristics for Knapsack Problems
of the problem, more complex problem instances must be solved by means of heuristic techniques to achieve an approximation of the exact solution in a reasonable amount......
Applied mathematics
- 2018 •
- JSC •
- Link
Rok uplatnění
JSC - Článek v periodiku v databázi SCOPUS
Výsledek na webu
- 1 - 10 out of 58 932