Outputs (2)

Width-Size Trade-offs for the Pigeon-Hole Principle. (2002)
Presentation / Conference Contribution
Dantchev, S. (2002, May). Width-Size Trade-offs for the Pigeon-Hole Principle. Presented at The 17th Annual Conference on Computational Complexity, Montreal, Canada

Improved sorting-based procedure for integer programming (2002)
Journal Article
Dantchev, S. (2002). Improved sorting-based procedure for integer programming. Mathematical Programming, 92(2), 297-300. https://doi.org/10.1007/s101070100245

Recently, Cornuéjols and Dawande have considered a special class of 0-1 programs that turns out to be hard for existing IP solvers. One of them is a sorting-based algorithm, based on an idea of Wolsey. In this paper, we show how to improve both the r... Read More about Improved sorting-based procedure for integer programming.