Combinatorial optimization problems with concave costs
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2009. === Includes bibliographical references (p. 83-89). === In the first part, we study the problem of minimizing a separable concave function over a polyhedron. We assume the concave fu...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
Massachusetts Institute of Technology
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/46661 |