Advanced Search
DSpace@MIT

Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems

Research and Teaching Output of the MIT Community

Files in this item

Name Size Format Description
OR391-12.pdf 304.4Kb PDF

The following license files are associated with this item:

This item appears in the following Collection(s)

MIT-Mirage