Constraints最新文献_第6页

Learning optimal decision trees using constraint programming 使用约束规划学习最优决策树

IF 1.6 4区计算机科学

Constraints Pub Date : 2020-07-01 DOI: 10.1007/s10601-020-09312-3

Hélène Verhaeghe, Siegfried Nijssen, G. Pesant, Claude-Guy Quimper, P. Schaus

引用次数: 67

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

IF 1.6 4区计算机科学

Constraints Pub Date : 2020-06-12 DOI: 10.4230/LIPIcs.CP.2021.33

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

{"title":"Learning the travelling salesperson problem requires rethinking generalization","authors":"Chaitanya K. Joshi, Quentin Cappart, Louis-Martin Rousseau, T. Laurent","doi":"10.4230/LIPIcs.CP.2021.33","DOIUrl":"https://doi.org/10.4230/LIPIcs.CP.2021.33","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":"27 1","pages":"70 - 98"},"PeriodicalIF":1.6,"publicationDate":"2020-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42327443","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}

引用次数: 31

XCSP 3 and its ecosystem XCSP 3及其生态系统

IF 1.6 4区计算机科学

Constraints Pub Date : 2020-02-06 DOI: 10.1007/s10601-019-09307-9

Gilles Audemard, Frédéric Boussemart, Christophe Lecoutre, Cédric Piette, Olivier Roussel

引用次数: 1

Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem 综合整数规划和决策图搜索树及其在最大独立集问题中的应用

IF 1.6 4区计算机科学

Constraints Pub Date : 2020-01-15 DOI: 10.1007/s10601-019-09306-w

Jaime E. González, A. Ciré, Andrea Lodi, Louis-Martin Rousseau

引用次数: 13

Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs 用强制模式和禁止模式生成图形的约束:在分子图中的应用