Combinatorial optimization problems with concave costs
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2009.
Main Author: | Stratila, Dan |
---|---|
Other Authors: | Thomas Magnanti. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2009
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/46661 |
Similar Items
-
Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems
by: Magnanti, Thomas L., et al.
Published: (2012) -
Vignettes on robust combinatorial optimization
by: Udwani, Rajan
Published: (2019) -
Combinatorial structures in online and convex optimization
by: Gupta, Swati, Ph. D. Massachusetts Institute of Technology
Published: (2017) -
Algorithmic issues in queueing systems and combinatorial counting problems
by: Katz-Rogozhnikov, Dmitriy A
Published: (2009) -
Online optimization problems
by: Lu, Xin
Published: (2013)