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”

On the Complexity of Some Facet-Defining Inequalities of the QAP-Polytope

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10423982" target="_blank" >RIV/00216208:11320/20:10423982 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1007/978-3-030-64843-5_23" target="_blank" >https://doi.org/10.1007/978-3-030-64843-5_23</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-030-64843-5_23" target="_blank" >10.1007/978-3-030-64843-5_23</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    On the Complexity of Some Facet-Defining Inequalities of the QAP-Polytope

  • Original language description

    In this paper we consider all the known exponential-sized families of facet-defining inequalities of the QAP-polytope. We describe a new family of valid inequalities that we show to be facet-defining. We also show that membership testing (and hence optimizing) over some of the known classes of inequalities is coNP-complete.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

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

Result continuities

  • Project

    <a href="/en/project/GA17-09142S" target="_blank" >GA17-09142S: Modern algorithms: New challenges of complex data sets</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2020

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    14th International Conference on Combinatorial Optimization and Applications, COCOA 2020

  • ISBN

    978-3-030-64842-8

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    16

  • Pages from-to

    334-349

  • Publisher name

    Springer Science and Business Media Deutschland GmbH

  • Place of publication

    Německo

  • Event location

    Dallas, USA

  • Event date

    Dec 11, 2020

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article