Showing 1 - 20 results of 37 for search '"discrete optimisation"', query time: 0.27s Refine Results
  1. 1

    An Algebraic Theory of Complexity for Discrete Optimisation by Cohen, D, Cooper, M, Creed, P, Jeavons, P, Zivny, S

    Published 2012
    “…Discrete optimisation problems arise in many different areas and are studied under many different names. …”
    Journal article
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8

    Discrete resource allocation to groups of customers by Vytautas Tiešis

    Published 2005-12-01
    Subjects: “…discrete optimisation…”
    Get full text
    Article
  9. 9
  10. 10
  11. 11

    An optimisation model for minimising changes in frequency allocations by J.E. Beasley

    Published 2022-01-01
    Subjects: “…Discrete optimisation…”
    Get full text
    Article
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16

    Minimal weighted clones with Boolean support by Jeavons, P, Vaicenavicius, A, Zivny, S

    Published 2016
    “…These structures characterise the computational complexity of discrete optimisation problems of special form, known as valued constraint satisfaction problems. …”
    Conference item
  17. 17

    The complexity of Boolean surjective general-valued CSPs by Fulla, P, Zivny, S

    Published 2017
    “…Valued constraint satisfaction problems (VCSPs) are discrete optimisation problems with the objective function given as a sum of fixed-arity functions; the values are rational numbers or infinity. …”
    Conference item
  18. 18

    An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection. by Cohen, D, Creed, P, Jeavons, P, Zivny, S

    Published 2011
    “…Valued constraint satisfaction problems are discrete optimisation problems where the function to be minimised is given as a sum of cost functions defined on specified subsets of variables. …”
    Journal article
  19. 19

    An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection by Cohen, D, Creed, P, Jeavons, P, Zivny, S

    Published 2010
    “…Valued constraint satisfaction problems are discrete optimisation problems where the function to be minimised is given as a sum of cost functions de ned on speci ed subsets of variables. …”
    Report
  20. 20

    Solving Complex Optimisation Problems by Machine Learning by Steven Prestwich

    Published 2024-07-01
    “…We define a broad class of discrete optimisation problem called an influence program, and describe a lightweight algorithm based on multi-agent multi-objective reinforcement learning with sampling. …”
    Get full text
    Article