All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”
EN
ČeštinaEnglish

Filters

4 802 (0,105s) •

Project

NP-Hard Problems in Operations Research (GA402/06/0123)

powerful optimization software. The primary issue is the NP-hard problems as theOperations research deals with the modeling and solving practical problems consisting in finding an optimal economic decision. Since ...

BB - Aplikovaná statistika, operační výzkum

  • 2006 - 2008
    • •
  • 1 140 tis. Kč
    • •
  • 1 140 tis. Kč
    • •
  • GA ČR
Project

Structural properties of graphs and graph classes (ME 418)

, especially on those that are related to some algorithmically very difficult (NP-hard) problems. The importance of this direction of research is given by the fact that in such subclasses many NP-hard ...

BA - Obecná matematika

  • 2001 - 2003
    • •
  • 402 tis. Kč
    • •
  • 190 tis. Kč
    • •
  • MŠMT
Project

Parameterized Algorithms for Fundamental Network Problems Related to Connectivity (GP14-13017P)

to solve computationally hard (NP-hard) problems. The running time here is expressed provides a more refined analysis of where the hardness of the problem comes from and also to show that for som...

IN - Informatika

  • 2014 - 2016
    • •
  • 1 649 tis. Kč
    • •
  • 1 649 tis. Kč
    • •
  • GA ČR
Project

Structural properties and algorithmic complexity of discrete problems (GA201/05/0050)

of the basic discrete problems are "almost unsolvable" (NP-hard) in their general formulation. Still,one has to look for, at least, approximate solutions to hard problems allowing for effective solutions ...

BA - Obecná matematika

  • 2005 - 2007
    • •
  • 472 tis. Kč
    • •
  • 453 tis. Kč
    • •
  • GA ČR
Project

Colourings, cycles and closures (MEB101014)

In this joint project we will consider two important problems in the field of Graph Theory. The first problem asks for the computation of a minimum rainbow subgraph (MRS) of a given graph G; The second problem asks for the ...

BA - Obecná matematika

  • 2010 - 2011
    • •
  • 90 tis. Kč
    • •
  • 90 tis. Kč
    • •
  • MŠMT
Project

Well-structured combinatorial classes, width parameters, and design of efficient algorithms (GAP202/11/0196)

Many important algorithmic problems are known to be NP-hard and thus it is unlikely that they could be solved efficiently on all possible inputs. One approach to cope with such problems is the use of parameterized ...

IN - Informatika

  • 2011 - 2013
    • •
  • 4 928 tis. Kč
    • •
  • 4 928 tis. Kč
    • •
  • GA ČR
Project

Combinatorial Optimization Problems in Transportation Systems (GPP402/12/P635)

problems. The handled problems belong to the NP-hard class thus metaheuristic methods task for sustainability of logistic systems. Various problems arising in the practise can be formulated as combinatori...

BB - Aplikovaná statistika, operační výzkum

  • 2012 - 2016
    • •
  • 1 582 tis. Kč
    • •
  • 1 582 tis. Kč
    • •
  • GA ČR
Project

Graph Covers Symmetries and Complexity (GA20-15576S)

-completeness on one-hand side, and GI-completeness and NP-hardness on the other one. of graph covering problems. The project is aimed at investigation of computational complexity of such problems, including sever...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2020 - 2023
    • •
  • 8 573 tis. Kč
    • •
  • 7 581 tis. Kč
    • •
  • GA ČR
Project

Optimization models in production and transportation (GA402/09/0041)

to determine their efficiency. Many of the problems are NP-hard similarly. It deals with job scheduling problems, especially multi-levels problems. There are many modifications of this problem ba...

BB - Aplikovaná statistika, operační výzkum

  • 2009 - 2011
    • •
  • 1 344 tis. Kč
    • •
  • 1 344 tis. Kč
    • •
  • GA ČR
Project

Tight Parameterized Results for Directed Connectivity Problems (GA17-20065S)

a standard approach for (NP-) hard computational problems. Here, in contrast to classical. In this research proposal we target on several fundamental problems in network design related obtain new algorithms for ...

IN - Informatika

  • 2017 - 2019
    • •
  • 1 986 tis. Kč
    • •
  • 1 620 tis. Kč
    • •
  • GA ČR
  • 1 - 10 out of 4 802