Separable Concave Optimization Approximately Equals Piecewise-Linear Optimization
Main Authors: | Magnanti, Thomas L., Stratila, Dan |
---|---|
Format: | Working Paper |
Language: | en_US |
Published: |
Massachusetts Institute of Technology, Operations Research Center
2012
|
Online Access: | http://hdl.handle.net/1721.1/68610 |
Similar Items
-
Separable Concave Optimization Approximately Equals
by: Magnanti, Thomas L., et al.
Published: (2006) -
Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems
by: Magnanti, Thomas L., et al.
Published: (2012) -
Combinatorial optimization problems with concave costs
by: Stratila, Dan
Published: (2009) -
Sampling-Based Polytopic Trees for Approximate Optimal Control of Piecewise Affine Systems
by: Sadraddini, Sadra, et al.
Published: (2021) -
A Comparison of Mixed-Integer Programming Models for Non-Convex Piecewise Linear Cost Minimization Problems
by: Croxton, Keely L., et al.
Published: (2004)