@article{Hamacher1984a, 
     author = "Hamacher, Horst W. and Picard, Jean-Claude and Queyranne, Maurice", 
     doi = "10.1016/0167-6377(84)90083-X", 
     issn = "01676377", 
     journal = "Operations Research Letters", 
     keyword = "Flow algorithm,cut,ranking of solutions", 
     link = "http://www.sciencedirect.com/science/article/pii/016763778490083X http://linkinghub.elsevier.com/retrieve/pii/016763778490083X", 
     month = "mar", 
     number = "6", 
     pages = "303--305", 
     title = "On Finding the K Best Cuts in a Network", 
     uri = "http://www.sciencedirect.com/science/article/pii/016763778490083X", 
     volume = "2", 
     year = "1984", 
}

Problems: 70 371