Constraints最新文献_第3页

Short- and medium-term optimization of underground mine planning using constraint programming 应用约束规划的地下矿山规划中短期优化

IF 1.6 4区计算机科学

Constraints Pub Date : 2022-09-27 DOI: 10.1007/s10601-022-09337-w

Louis-Pierre Campeau, M. Gamache

引用次数: 1

Solution sampling with random table constraints 具有随机表约束的解采样

IF 1.6 4区计算机科学

Constraints Pub Date : 2022-06-24 DOI: 10.1007/s10601-022-09329-w

Mathieu Vavrille, C. Truchet, Charles Prud’homme

引用次数: 2

How constraint programming can help chemists to generate Benzenoid structures and assess the local Aromaticity of Benzenoids 约束规划如何帮助化学家生成苯类化合物结构并评估苯类化合物的局部芳香性

IF 1.6 4区计算机科学

Constraints Pub Date : 2022-05-28 DOI: 10.1007/s10601-022-09328-x

Yannick Carissan, D. Hagebaum-Reignier, Nicolas Prcovic, C. Terrioux, A. Varet

引用次数: 1

When bounds consistency implies domain consistency for regular counting constraints 当边界一致性意味着正则计数约束的域一致性时

IF 1.6 4区计算机科学

Constraints Pub Date : 2022-05-20 DOI: 10.1007/s10601-022-09333-0

B. Martin, J. Pearson

引用次数: 0

The smallest hard trees 最小的硬树

IF 1.6 4区计算机科学

Constraints Pub Date : 2022-05-16 DOI: 10.1007/s10601-023-09341-8

M. Bodirsky, Jakub Bulín, Florian Starke, Michael Wernthaler

引用次数: 0

Learning the travelling salesperson problem requires rethinking generalization 学习旅行推销员问题需要重新思考概括

IF 1.6 4区计算机科学

Constraints Pub Date : 2022-04-28 DOI: 10.1007/s10601-022-09327-y

Chaitanya K. Joshi, Quentin Cappart, Louis-Martin Rousseau, Thomas Laurent

{"title":"Learning the travelling salesperson problem requires rethinking generalization","authors":"Chaitanya K. Joshi, Quentin Cappart, Louis-Martin Rousseau, Thomas Laurent","doi":"10.1007/s10601-022-09327-y","DOIUrl":"https://doi.org/10.1007/s10601-022-09327-y","url":null,"abstract":"End-to-end training of neural network solvers for graph combinatorial optimization problems such as the Travelling Salesperson Problem (TSP) have seen a surge of interest recently, but remain intractable and inefficient beyond graphs with few hundreds of nodes. While state-of-the-art learning-driven approaches for TSP perform closely to classical solvers when trained on trivially small sizes, they are unable to generalize the learnt policy to larger instances at practical scales. This work presents an end-to-end neural combinatorial optimization pipeline that unifies several recent papers in order to identify the inductive biases, model architectures and learning algorithms that promote generalization to instances larger than those seen in training. Our controlled experiments provide the first principled investigation into such zero-shot generalization, revealing that extrapolating beyond training data requires rethinking the neural combinatorial optimization pipeline, from network layers and learning paradigms to evaluation protocols. Additionally, we analyze recent advances in deep learning for routing problems through the lens of our pipeline and provide new directions to stimulate future research.","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"23 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2022-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138503088","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A constraint-based approach to learn temporal features on action models from multiple plans 基于约束的多计划动作模型时间特征学习方法

IF 1.6 4区计算机科学

Constraints Pub Date : 2022-04-01 DOI: 10.1007/s10601-022-09330-3

Antonio Garrido

引用次数: 0

Concise integer linear programming formulation for clique partitioning problems 团划分问题的简洁整数线性规划公式

IF 1.6 4区计算机科学

Constraints Pub Date : 2022-04-01 DOI: 10.1007/s10601-022-09326-z

M. Koshimura, Emi Watanabe, Y. Sakurai, M. Yokoo

引用次数: 2

Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs 一类唯一Hamilton图的完全对称破缺约束