The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard. In this paper, we present two tabu search implementations, one involving...

Modeling Reverse Logistics Network for Post-Sale Service Under International Ecosystem -- Sustainable Parallel Machine Scheduling: Trade-Off Between Tardiness And Energy Consumption -- Modeling A Coordinated Supply Chain Under Service Level Constraint With Price-Sensitive Stochastic Demand And...

The Modeling and Implementing Process -- Network Theory -- References with Comments -- Shortest Paths -- Minimum Spanning Trees -- Network Flows -- Matchings -- Facility Location -- Cyclic Routing on Networks -- Erratum

The selection of entries to be included/excluded in Branch and Bound algorithms is usually done on the basis of cost values. We consider the class of Depth First Search algorithms, and we propose to use upper tolerances to guide the search for optimal solutions. In spite of the fact that it...