activity
20132023
most citedDouble Well Potential Function and Its Optimization in the n-dimensional Real Space - Part II

1 citations · 2 across the 6 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2013

Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms

Kameng Nip, Zhenbo Wang, Wenxun Xing

We consider several combinatorial optimization problems which combine the classic shop scheduling problems, namely open shop scheduling or job shop scheduling, and the shortest pat…