Convex separable optimization is not much harder than linear optimization 论文

1990Journal of the ACM引用 241
DOIPDF
Complexity and Algorithms in GraphsComputational Geometry and Mesh GenerationAdvanced Optimization Algorithms Research
Advanced Optimization Algorithms ResearchComplexity and Algorithms in GraphsComputational Geometry and Mesh Generation
相关技术:Complexity and Algorithms in GraphsAdvanced Optimization Algorithms ResearchComputational Geometry and Mesh Generation
关系图谱

Convex separable optimization is not much harder than linear optimization · 相关文章

暂无数据