-
1
An Algebraic Theory of Complexity for Discrete Optimisation
Published 2012“…Discrete optimisation problems arise in many different areas and are studied under many different names. …”
Journal article -
2
-
3
-
4
Tractable triangles and cross−free convexity in discrete optimisation
Published 2012Journal article -
5
Multimodal surface matching: fast and generalisable cortical registration using discrete optimisation.
Published 2013Journal article -
6
Multimodal surface matching: fast and generalisable cortical registration using discrete optimisation.
Published 2013Journal article -
7
-
8
Discrete resource allocation to groups of customers
Published 2005-12-01Subjects: “…discrete optimisation…”
Get full text
Article -
9
Robust and Realtime Large Deformation Ultrasound Registration Using End-to-End Differentiable Displacement Optimisation
Published 2023-03-01Subjects: Get full text
Article -
10
One-Dimensional Cutting Stock Optimisation by Suborders
Published 2018-01-01Subjects: Get full text
Article -
11
An optimisation model for minimising changes in frequency allocations
Published 2022-01-01Subjects: “…Discrete optimisation…”
Get full text
Article -
12
A Binary Expansion Approach for the Water Pump Scheduling Problem in Large and High-Altitude Water Supply Systems
Published 2024-08-01Subjects: “…discrete optimisation…”
Get full text
Article -
13
Set-Based Particle Swarm Optimisation: A Review
Published 2023-07-01Subjects: Get full text
Article -
14
Highly efficient scheduling algorithms for identical parallel machines with sufficient conditions for optimality of the solutions
Published 2024-01-01Subjects: “…intractable problems of discrete optimisation…”
Get full text
Article -
15
Optimisation of photovoltaic and battery systems from the prosumer-oriented total cost of ownership perspective
Published 2019-12-01Subjects: Get full text
Article -
16
Minimal weighted clones with Boolean support
Published 2016“…These structures characterise the computational complexity of discrete optimisation problems of special form, known as valued constraint satisfaction problems. …”
Conference item -
17
The complexity of Boolean surjective general-valued CSPs
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
An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection.
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
An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection
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
Solving Complex Optimisation Problems by Machine Learning
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