A Schedule Algebra Based Approach to Determine the K-Best Solutions of a Knapsack Problem with a Single Constraint

Subhash C. Sarin, Yuqiang Wang, Dae B. Chang. A Schedule Algebra Based Approach to Determine the K-Best Solutions of a Knapsack Problem with a Single Constraint. In Nimrod Megiddo, Yinfeng Xu, Binhai Zhu, editors, Algorithmic Applications in Management, First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings. Volume 3521 of Lecture Notes in Computer Science, pages 440-449, Springer, 2005. [doi]

@inproceedings{SarinWC05,
  title = {A Schedule Algebra Based Approach to Determine the K-Best Solutions of a Knapsack Problem with a Single Constraint},
  author = {Subhash C. Sarin and Yuqiang Wang and Dae B. Chang},
  year = {2005},
  doi = {10.1007/11496199_47},
  url = {http://dx.doi.org/10.1007/11496199_47},
  tags = {constraints, C++,  algebra, systematic-approach},
  researchr = {https://researchr.org/publication/SarinWC05},
  cites = {0},
  citedby = {0},
  pages = {440-449},
  booktitle = {Algorithmic Applications in Management, First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings},
  editor = {Nimrod Megiddo and Yinfeng Xu and Binhai Zhu},
  volume = {3521},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-26224-5},
}