HACK
发表于 2025-3-28 18:05:00
An Exact CP Approach for the Cardinality-Constrained Euclidean Minimum Sum-of-Squares Clustering Proe problem to improve several aspects of previous constraint programming approaches: lower bounds, domain filtering, and branching. Computational experiments on benchmark instances taken from the literature confirm that our approach improves our solving capability over previously-proposed exact methods for this problem.
婴儿
发表于 2025-3-28 20:43:52
http://reply.papertrans.cn/47/4689/468838/468838_42.png
Merited
发表于 2025-3-28 23:10:02
http://reply.papertrans.cn/47/4689/468838/468838_43.png
边缘带来墨水
发表于 2025-3-29 05:34:23
The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositionsd in the literature to identify tractable fragments of CSPs. However, also the computation of a concrete hypergraph decomposition is a challenging task in itself. In this paper, we report on recent progress in the study of hypergraph decompositions and we outline several directions for future research.
nitric-oxide
发表于 2025-3-29 08:17:48
Local Search and Constraint Programming for a Real-World Examination Timetabling Problemboth a metaheuristic approach based on Simulated Annealing and a Constraint Programming model in MiniZinc. We compare the results of the metaheuristic approach (properly tuned) with the available MiniZinc back-ends on a large set of diverse real-world instances.
Metastasis
发表于 2025-3-29 15:28:34
http://reply.papertrans.cn/47/4689/468838/468838_46.png
因无茶而冷淡
发表于 2025-3-29 15:37:53
A Learning-Based Algorithm to Quickly Compute Good Primal Solutions for Stochastic Integer Programsear constraints in both stages and consistently provide near-optimal solutions. Our computing times are very competitive with those of general-purpose integer programming solvers to achieve a similar solution quality.
fiction
发表于 2025-3-29 23:30:06
Reinforcement Learning for Variable Selection in a Branch and Bound AlgorithmTo our knowledge, it is the first time Reinforcement Learning has been used to fully optimise the branching strategy. Computational experiments show that our method is appropriate and able to generalise well to new instances.
ETHER
发表于 2025-3-30 01:07:54
http://reply.papertrans.cn/47/4689/468838/468838_49.png
Notify
发表于 2025-3-30 04:09:48
Restarting Algorithms: Sometimes There Is Free Lunchcorporated in the base algorithm or argument. We will review restarts in various settings from continuous optimization, discrete optimization, and submodular function maximization where they have delivered impressive results.