Filters
Solving Set Covering Problem Using Simulated Annealing
Set Covering Problem is one of the most interesting problems of the current research. This work is solving the special version of set covering problem which includes the distances between...
Communication engineering and systems
- 2019 •
- R •
- Link
Rok uplatnění
R - Software
Výsledek na webu
Optimisation in a Wholesale Company: A Case study
Main topics of the document: vehicle routing problem; location set covering problem; supply chain design; cost; customer service......
Public administration
- 2017 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Separation problems and forcing
Certain separation problems in descriptive set theory correspond to a forcing preservation property, with a fusion type infinite game associated to it. As an application, it is consistent with the axioms of set theory that ...
BA - Obecná matematika
- 2013 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Evolutionary optimization of set-covering problem
The article aims how to use evolutionary algorithms in solving a set-covering problem. We have focused on the bin packing problem. This problem is known to be NP-hard; hence many heuristic procedures for i...
IN - Informatika
- 2016 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
A Minimisation of Network Covering Services in a Threshold Distance
In this paper, we deal with a special version of the set covering problem into a general set covering problem. However, this has a combinatorial nature and, because it belongs tothe class of NP-ha...
IN - Informatika
- 2015 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
A Minimisation of Network Covering Services in a Threshold Distance
In this paper, we deal with a special version of the set covering problem into a general set covering problem. However, this has a combinatorial nature and, because it belongs tothe class of NP-ha...
BB - Aplikovaná statistika, operační výzkum
- 2015 •
- C
Rok uplatnění
C - Kapitola v odborné knize
Local linear set on graphs with bounded twin cover number
Inspired by recent results for the so-called fair and local linear problems, we define two problems, LOCAL LINEAR SET and LOCAL LINEAR VERTEX COVER. Here the task is to find a set of vertices X subset of V...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2021 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Transportation Problem and Related Tasks with Application in Agriculture
. We show that the transportation problem can be transformed to an allocation, location and set covering problem using special constraints, but because of NP-hardness of the last problem it needs quite dif...
IN - Informatika
- 2014 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Minimisation of Network Covering Services with Predefined Centres
In this paper, we deal with a special version of the set covering problem into a general set covering problem. In order to reflect the importance of the centers, we nature and, because it belongs ...
Applied mathematics
- 2018 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
K-Triviality, Oberwolfach Randomness, and Differentiability
result by Day and Miller, this gives a positive solution to the ML-covering problem problem in the negative. We show that any witness for the solution of the covering problem, namely an incomplete random ...
IN - Informatika
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
- 1 - 10 out of 179 650