Track: Facilities Planning and Management
Abstract
In this paper we give a new formulation of simple and capacitated forward and revese logistic planning problem. It is posed a mixed 0-1 integer linear programming problem. Sever novel linking constraints are added here.
Key Words: 0-1 MILP, Forward and Revese Logistic Problem