Talk:Linear bottleneck assignment problem
I propose merging this page into Assignment problem. This page has existed since 2010, but it is a stub and seemingly, virtually all of the sections on this pag
 | This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Merge proposal
I propose merging this page into Assignment problem. This page has existed since 2010, but it is a stub and seemingly, virtually all of the sections on this page are currently also found on the Assignment problem page. I do not think a merge would not cause any article-size or weighting problems. A mentally disabled mathematician (talk) 12:28, 12 March 2025 (UTC)
- Oppose merge. Funny you should talk about weighting problems. The weights are what make these two problems different. The assignment problem, when named without other qualification, always means the problem where one maximizes the total weight, the sum of the weights of all chosen pairs. The bottleneck assignment problem, on the other hand, uses a different optimization criterion of minimizing the maximum of the weights of all chosen pairs. Because it is a different problem it has different optimization criteria. I think that trying to talk about one problem with one formulation, on an article about a different problem with a different formulation, would overload the combined article and confuse readers trying to look up either problem. Neither article is actually very stubby and the bottleneck article could be expanded from many published sources, so I don't see what benefit would be obtained in exchange for this increased confusion. —David Eppstein (talk) 07:30, 20 March 2025 (UTC)
- Closing with no merge, given the uncontested objection and no support with stale discussion. Klbrain (talk) 14:47, 30 April 2025 (UTC)
Content Disclaimer
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.
- The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
- There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
- It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
- Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
- Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.