15 citations · 33 across the 13 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2019
Solving Splitted Multi-Commodity Flow Problem by Efficient Linear Programming Algorithm
Liyun Dai, Hengjun Zhao, Zhiming Liu
Column generation is often used to solve multi-commodity flow problems. A program for column generation always includes a module that solves a linear equation. In this paper, we ad…
math.OC2014
Smaller SDP for SOS Decomposition
Liyun Dai, Bican Xia
A popular numerical method to compute SOS (sum of squares of polynomials) decompositions for polynomials is to transform the problem into semi-definite programming (SDP) problems a…