Computing a lower bound for the solution of a Robotic Process Automation (RPA) problem using network flows.
Imène BenkalaïSara SéguinHugo TremblayGeoffrey GlanginePublished in: CoDIT (2020)
Keyphrases
- network flow
- lower bound
- network flow formulation
- minimum cost
- process automation
- optimal solution
- np hard
- upper bound
- integer programming
- min cost
- linear programming
- optimization model
- branch and bound algorithm
- lagrangian relaxation
- worst case
- integer program
- mobile robot
- objective function
- bipartite graph
- social networks
- branch and bound
- high level