blocks|key|1120700|text|您可能会在像算法简介这样的算法教科书中找到最好的。虽然我从未读过那本书，但这本书以彻底著称，而且可能包含了你可能会遇到的大部分问题。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1120701|entityMap|0|LINK|mutability|MUTABLE|url|https://rads.stackoverflow.com/amzn/click/com/0262032937^0|6|4|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

You can probably find the best in an algorithms textbook like <a href="https://rads.stackoverflow.com/amzn/click/com/0262032937" rel="nofollow noreferrer" rel="nofollow noreferrer">Introduction to Algorithms</a>. Though I've never read that particular book, it's quite renowned for being thorough and would probably contain most of the problems you're likely to encounter.

blocks|key|823552|text|盖里和约翰逊的“计算机与难解:NP-完备理论指南”是这类事物的一个很好的参考，尽管“解决”问题(在P中)在书中显然没有得到足够的重视。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|823553|我不知道有什么好的在线资源，但是Karp关于缩减和复杂性的开创性论文组合问题的可约性(1972)可能是困难问题的“规范”参考。|823554|entityMap|0|LINK|mutability|MUTABLE|url|http://portal.acm.org/citation.cfm?id=578533|1|http://en.wikipedia.org/wiki/Karp%2527s_21_NP-complete_problems^0|7|I|0|0|Y|E|1|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@$A|Q|B|R|1|S]]|C|$]]|$1|D|3|E|5|6|7|T|8|@]|9|@$A|U|B|V|1|W]]|C|$]]|$1|F|3|-4|5|6|7|X|8|@]|9|@]|C|$]]]|G|$H|$5|I|J|K|C|$L|M]]|N|$5|I|J|K|C|$L|O]]]]

<a href="http://portal.acm.org/citation.cfm?id=578533" rel="nofollow noreferrer">"Computers and Intractability: A guide to the theory of NP-Completeness"</a> by Garey and Johnson is a great reference for this sort of thing, although the "solved" problems (in P) are obviously not given much attention in the book.

I'm not aware of any good on-line resources, but Karp's seminal paper <a href="http://en.wikipedia.org/wiki/Karp%27s_21_NP-complete_problems" rel="nofollow noreferrer">Reducibility among Combinatorial Problems (1972)</a> on reductions and complexity is probably the "canonical" reference for Hard Problems.

blocks|key|823577|text|你看过维基百科的类别:计算问题和范畴:NP完全问题页面吗？它可能不是完整的，但它们看起来像是一个很好的起点。维基百科似乎在CS主题方面做得很好。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|823578|entityMap|0|LINK|mutability|MUTABLE|url|http://en.wikipedia.org/wiki/Category:Computational_problems|1|http://en.wikipedia.org/wiki/Category:NP-complete_problems^0|8|7|0|G|9|1|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@$A|O|B|P|1|Q]|$A|R|B|S|1|T]]|C|$]]|$1|D|3|-4|5|6|7|U|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]|L|$5|G|H|I|C|$J|M]]]]

Have you looked at Wikipedia's <a href="http://en.wikipedia.org/wiki/Category:Computational_problems" rel="nofollow noreferrer">Category:Computational problems</a> and <a href="http://en.wikipedia.org/wiki/Category:NP-complete_problems" rel="nofollow noreferrer">Category:NP Complete Problems</a> pages? It's probably not complete, but they look like good starting points. Wikipedia seems to do pretty well in CS topics.

blocks|key|1121012|text|我不认为你只会在一本书中找到所有这些问题的答案。我从来没有见过任何关于算法的好的，全面的网站，所以我建议你坚持这些书。尽管如此，你总是可以得到一些关于规范算法文本的介绍性材料(我通常推荐三种：CLRS、曼伯、Aho，Hopcroft和Ullman+(这一篇在一些关键主题上有点过时了，但它是如此的正式和精良，以至于它是必须阅读的)。它们都包含着重要的组合问题，从某种意义上说，它们都是计算机科学中的典型问题。在学习了图论中的一些基本知识之后，您将能够转向网络流和线性规划。这些技术将最终解决您将遇到的大多数问题(将变量限制为整数值的线性规划是NP难的)。网络流处理图上定义的问题(具有加权/容限边)，在似乎与图论无关的领域中具有非常有趣的应用。这方面的教科书是阿胡贾，马格南蒂和奥林。线性规划是网络流的一种超集，它以线性方程组的形式对受约束变量的线性函数进行优化。一本强调与网络流的关系的书是巴扎拉。然后，您可以继续进行整数规划，这是一个非常有价值的工具，它为建模问题提供了许多自然的技术，如装箱包装、任务调度、背包问题等等。一个很好的参考是沃尔西氏病的书。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1121013|entityMap|0|LINK|mutability|MUTABLE|url|https://rads.stackoverflow.com/amzn/click/com/0262032937|1|https://rads.stackoverflow.com/amzn/click/com/0201120372|2|https://rads.stackoverflow.com/amzn/click/com/0201000296|3|https://rads.stackoverflow.com/amzn/click/com/013617549X|4|https://rads.stackoverflow.com/amzn/click/com/0471485993|5|https://rads.stackoverflow.com/amzn/click/com/0471283665^0|2O|4|0|2T|2|1|2W|J|2|96|B|3|B0|3|4|D3|5|5|0^^$0|@$1|2|3|4|5|6|7|V|8|@]|9|@$A|W|B|X|1|Y]|$A|Z|B|10|1|11]|$A|12|B|13|1|14]|$A|15|B|16|1|17]|$A|18|B|19|1|1A]|$A|1B|B|1C|1|1D]]|C|$]]|$1|D|3|-4|5|6|7|1E|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]|L|$5|G|H|I|C|$J|M]]|N|$5|G|H|I|C|$J|O]]|P|$5|G|H|I|C|$J|Q]]|R|$5|G|H|I|C|$J|S]]|T|$5|G|H|I|C|$J|U]]]]

I don't think you'll find the answers to all those problems in only one book. I've never seen any decent, comprehensive website on algorithms, so I'd recommend you to stick to the books. That said, you can always get some introductory material on canonical algorithm texts (there are always three I usually recommend: <a href="https://rads.stackoverflow.com/amzn/click/com/0262032937" rel="nofollow noreferrer" rel="nofollow noreferrer">CLRS</a>, <a href="https://rads.stackoverflow.com/amzn/click/com/0201120372" rel="nofollow noreferrer" rel="nofollow noreferrer">Manber</a>, <a href="https://rads.stackoverflow.com/amzn/click/com/0201000296" rel="nofollow noreferrer" rel="nofollow noreferrer">Aho, Hopcroft and Ullman</a> (this one is a bit out of date in some key topics, but it's so formal and well-written that it's a must-read). All of them contain important combinatorial problems that are, in some sense, canonical problems in computer science. After learning some fundamentals in graph theory you'll be able to move to Network Flows and Linear Programming. These comprise a set of techniques that will ultimately solve most problems you'll encounter (linear programming with the variables restricted to integer values is NP-hard). Network flows deals with problems defined on graphs (with weighted/capacitated edges) with very interesting applications in fields that seemingly have no relationship to graph theory whatsoever. THE textbook on this is <a href="https://rads.stackoverflow.com/amzn/click/com/013617549X" rel="nofollow noreferrer" rel="nofollow noreferrer">Ahuja, Magnanti and Orlin's</a>. Linear programming is some kind of superset of network flows, and deals with optimizing a linear function on variables subject to restrictions in the form of a linear system of equations. A book that emphasizes the relationship to network flows is <a href="https://rads.stackoverflow.com/amzn/click/com/0471485993" rel="nofollow noreferrer" rel="nofollow noreferrer">Bazaraa's</a>. Then you can move on to integer programming, a very valuable tool that presents many natural techniques for modelling problems like bin packing, task scheduling, the knapsack problem, and so on. A good reference would be <a href="https://rads.stackoverflow.com/amzn/click/com/0471283665" rel="nofollow noreferrer" rel="nofollow noreferrer">L. Wolsey's</a> book.

blocks|key|1121359|text|您肯定是，想看看NIST的算法和数据结构字典。它有旅行商问题，拜占庭将军问题，餐饮哲学家问题，背包问题+(我想是你的“垃圾箱包装问题”)，切割机料问题，八皇后问题，奈特旅游问题，繁忙海狸问题，停止问题等等。|type|unstyled|depth|inlineStyleRanges|offset|length|style|BOLD|entityRanges|data|1121360|它没有行刑队同步问题+(我对这一遗漏感到惊讶)或吉普车问题+(更多的物流而不是计算机科学)。|1121361|有趣的是，有一个关于codinghorror.com的博客，它以拼图的形式讲述了其中的一些。(我不记得我是否读过Smullyan在博客中引用的书，但他是拼图和哲学思考的好编辑。马丁·加德纳(+Martin+)、道格拉斯·霍夫施塔特(+Douglas+)和杜德尼是其他人。|1121362|另外，也可以查看石溪算法库。|1121363|(或者在google上查找“组合问题”，或者在沃尔夫拉姆·马西尔或希尔伯特问题中搜索“问题”，但在所有这些链接中，许多链接都比计算机科学更纯粹。)|1121364|entityMap|0|LINK|mutability|MUTABLE|url|http://www.nist.gov/dads/|1|http://www.nist.gov/dads/HTML/travelingSalesman.html|2|http://www.nist.gov/dads/HTML/byzantine.html|3|http://www.nist.gov/dads/HTML/diningphilos.html|4|http://www.nist.gov/dads/HTML/knapsackProblem.html|5|http://www.nist.gov/dads/HTML/cuttingStock.html|6|http://www.nist.gov/dads/HTML/eightqueens.html|7|http://www.nist.gov/dads/HTML/knightstour.html|8|http://www.nist.gov/dads/HTML/busyBeaver.html|9|http://www.nist.gov/dads/HTML/haltingProblem.html|10|http://en.wikipedia.org/wiki/Firing_squad_synchronization_problem|11|http://mathworld.wolfram.com/JeepProblem.html|12|http://www.codinghorror.com/blog/archives/000951.html|13|http://en.wikipedia.org/wiki/Henry_Dudeney|14|http://www.cs.sunysb.edu/~algorith/|15|http://mathworld.wolfram.com/search/index.html?query=problem|16|http://en.wikipedia.org/wiki/Hilbert%2527s_problems^0|4|1|D|9|0|P|5|1|V|7|2|13|7|3|1B|4|4|1X|6|5|24|5|6|2A|6|7|2H|6|8|2O|4|9|0|3|7|A|O|5|B|0|A|G|C|3J|3|D|0|8|5|E|0|N|9|F|X|6|G|0^^$0|@$1|2|3|4|5|6|7|1R|8|@$9|1S|A|1T|B|C]]|D|@$9|1U|A|1V|1|1W]|$9|1X|A|1Y|1|1Z]|$9|20|A|21|1|22]|$9|23|A|24|1|25]|$9|26|A|27|1|28]|$9|29|A|2A|1|2B]|$9|2C|A|2D|1|2E]|$9|2F|A|2G|1|2H]|$9|2I|A|2J|1|2K]|$9|2L|A|2M|1|2N]]|E|$]]|$1|F|3|G|5|6|7|2O|8|@]|D|@$9|2P|A|2Q|1|2R]|$9|2S|A|2T|1|2U]]|E|$]]|$1|H|3|I|5|6|7|2V|8|@]|D|@$9|2W|A|2X|1|2Y]|$9|2Z|A|30|1|31]]|E|$]]|$1|J|3|K|5|6|7|32|8|@]|D|@$9|33|A|34|1|35]]|E|$]]|$1|L|3|M|5|6|7|36|8|@]|D|@$9|37|A|38|1|39]|$9|3A|A|3B|1|3C]]|E|$]]|$1|N|3|-4|5|6|7|3D|8|@]|D|@]|E|$]]]|O|$P|$5|Q|R|S|E|$T|U]]|V|$5|Q|R|S|E|$T|W]]|X|$5|Q|R|S|E|$T|Y]]|Z|$5|Q|R|S|E|$T|10]]|11|$5|Q|R|S|E|$T|12]]|13|$5|Q|R|S|E|$T|14]]|15|$5|Q|R|S|E|$T|16]]|17|$5|Q|R|S|E|$T|18]]|19|$5|Q|R|S|E|$T|1A]]|1B|$5|Q|R|S|E|$T|1C]]|1D|$5|Q|R|S|E|$T|1E]]|1F|$5|Q|R|S|E|$T|1G]]|1H|$5|Q|R|S|E|$T|1I]]|1J|$5|Q|R|S|E|$T|1K]]|1L|$5|Q|R|S|E|$T|1M]]|1N|$5|Q|R|S|E|$T|1O]]|1P|$5|Q|R|S|E|$T|1Q]]]]

You definitely want to look at NIST's <a href="http://www.nist.gov/dads/" rel="nofollow noreferrer">Dictionary of Algorithms and Data Structures</a>. It's got the <a href="http://www.nist.gov/dads/HTML/travelingSalesman.html" rel="nofollow noreferrer">traveling salesman problem</a>, the <a href="http://www.nist.gov/dads/HTML/byzantine.html" rel="nofollow noreferrer">Byzantine generals problem</a>, the <a href="http://www.nist.gov/dads/HTML/diningphilos.html" rel="nofollow noreferrer">dining philosophers' problem</a>, the <a href="http://www.nist.gov/dads/HTML/knapsackProblem.html" rel="nofollow noreferrer">knapsack problem</a> (= your "bin packing problem", I think), the <a href="http://www.nist.gov/dads/HTML/cuttingStock.html" rel="nofollow noreferrer">cutting stock problem</a>, the <a href="http://www.nist.gov/dads/HTML/eightqueens.html" rel="nofollow noreferrer">eight queens problem</a>, the <a href="http://www.nist.gov/dads/HTML/knightstour.html" rel="nofollow noreferrer">knight's tour problem</a>, the <a href="http://www.nist.gov/dads/HTML/busyBeaver.html" rel="nofollow noreferrer">busy beaver problem</a>, the <a href="http://www.nist.gov/dads/HTML/haltingProblem.html" rel="nofollow noreferrer">halting problem</a>, etc. etc. 

It doesn't have the <a href="http://en.wikipedia.org/wiki/Firing_squad_synchronization_problem" rel="nofollow noreferrer">firing squad synchronization problem</a> (I'm surprised about that omission) or the <a href="http://mathworld.wolfram.com/JeepProblem.html" rel="nofollow noreferrer">Jeep problem</a> (more logistics than computer science).

Interestingly enough there's a blog on <a href="http://www.codinghorror.com/blog/archives/000951.html" rel="nofollow noreferrer">codinghorror.com</a> which talks about some of these in puzzle form. (I can't remember whether I've read Smullyan's book cited in the blog, but he is a good compiler of puzzles &amp; philosophical musings. Martin Gardner and Douglas Hofstadter and <a href="http://en.wikipedia.org/wiki/Henry_Dudeney" rel="nofollow noreferrer">H.E. Dudeney</a> are others.)

Also maybe check out the <a href="http://www.cs.sunysb.edu/~algorith/" rel="nofollow noreferrer">Stony Brook Algorithm Repository</a>. 

(Or look up "combinatorial problems" on google, or search for "problem" in <a href="http://mathworld.wolfram.com/search/index.html?query=problem" rel="nofollow noreferrer">Wolfram Mathworld</a> or look at <a href="http://en.wikipedia.org/wiki/Hilbert%27s_problems" rel="nofollow noreferrer">Hilbert's problems</a>, but in all these links many of them are more pure-mathematics than computer science.)

blocks|key|121688|text|@rcreswick这些听起来像是很好的推荐信，但对我所想的有些不太清楚。(然而，据我所知，这是最好的)|type|unstyled|depth|inlineStyleRanges|entityRanges|data|121689|我不会标记任何被接受的东西，希望人们能找到更好的参考。|121690|同时，我将在这里列出几个问题，可以自由地添加更多|121691|排序问题在给定的方式下找到单调集的阶|offset|length|style|BOLD|121692|+bin布局问题将集合划分为一个最小数目的集合，其中每个子集都比某个限制“小”|121693|--+travailing问题在加权图中找到了一个具有最小总权重的哈密顿圈|121694|entityMap^0|0|0|0|0|4|0|0|8|0|0|F|0^^$0|@$1|2|3|4|5|6|7|R|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|S|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|T|8|@]|9|@]|A|$]]|$1|F|3|G|5|6|7|U|8|@$H|V|I|W|J|K]]|9|@]|A|$]]|$1|L|3|M|5|6|7|X|8|@$H|Y|I|Z|J|K]]|9|@]|A|$]]|$1|N|3|O|5|6|7|10|8|@$H|11|I|12|J|K]]|9|@]|A|$]]|$1|P|3|-4|5|6|7|13|8|@]|9|@]|A|$]]]|Q|$]]

@rcreswick those sound like good references but fall a bit shy of what I'm thinking of. (However, for all I know, it's the best there is)

I'm going to not mark anything as accepted in hopes people might find a better reference.

Meanwhile, I'm going to list a few problems here, fell free to add more

The sorting problem Find an order for a set that is monotonic in a given way

The bin packing problem partition a set into a minimum number of sets where each subset is "smaller" than some limit

The travailing salesman problem Find a Hamiltonian cycle in a weighted graph with the minimum total weight

Does anyone known of a a good reference for canonical CS problems?

I'm thinking of things like "the sorting problem", "the bin packing problem", "the travailing salesman problem" and what not.

edit: websites preferred

canonical problems list

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

教程

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云智能顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云AI代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

功能1上新10个字符

功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符。

功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符。

功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符

功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符

功能4上新

文章&问答评论现已支持表情

全新交互，全新视觉，新增快捷键、悬浮工具栏、高亮块等功能并同时优化现有功能，全面提升创作效率和体验

社区富文本编辑器全新改版！诚邀体验～ 

精选全网热门MCP server，让你的AI更好用 🚀

💥开发者 MCP广场重磅上线！

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

聚焦“写作效率、视觉美观与运行性能”三方面进行全面升级，为您提供更高效、稳定的创作环境

社区富文本&Markdown编辑器全新改版上线，欢迎大家体验!

诚挚邀请您参与本次调研，分享您的真实使用感受与建议。您的反馈至关重要，感谢您的支持与参与！

社区新版编辑器体验调研

有没有人知道规范CS问题有一个很好的参考？我想到的是“分拣问题”、“垃圾箱包装问题”、“销售人员问题”等等。编辑：网站首选

问典型问题列表
EN

回答 6

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问典型问题列表EN

回答 6

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问典型问题列表
EN