3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DS2017
Approximate solution of length-bounded maximum multicommodity flow with unit edge-lengths
Pavel Borisovsky, Anton Eremeev, Sergei Hrushev +2
An improved fully polynomial-time approximation scheme and a greedy heuristic for the fractional length-bounded maximum multicommodity flow problem with unit edge-lengths are propo…
math.OC2014★ 3 cited
Reducing the Number of Changeover Constraints in a MIP Formulation of a Continuous-Time Scheduling Problem
Pavel A. Borisovsky, Anton V. Eremeev, Josef Kallrath
In this paper, we develop a new formulation of changeover constraints for mixed integer programming problem (MIP) that emerges in solving a short-term production scheduling problem…