Similar Search Results

A mixture of dynamic programming and branch-and-bound for the subset-sum program

Martello, Silvano; Toth, Paolo - In: Management science : journal of the Institute for … 30 (1984) 6, pp. 765-771

Persistent link: https://www.econbiz.de/10003626094

Optimal and canonical solutions to the change making problem

Martello, Silvano; Toth, Paolo - In: European journal of operational research : EJOR 4 (1980) 5, pp. 321-329

Persistent link: https://www.econbiz.de/10003626132

Solution of the zero-one multiple knapsack problem

Martello, Silvano; Toth, Paolo - In: European journal of operational research : EJOR 4 (1980) 4, pp. 276-283

Persistent link: https://www.econbiz.de/10003626139

An upper bound for the zero-one knapsack problem and a branch and bound algorithm

Martello, Silvano; Toth, Paolo - In: European journal of operational research : EJOR 1 (1977) 3, pp. 169-175

Persistent link: https://www.econbiz.de/10003626142

An algorithm for the generalized assignment problem - Un algorithme pour le problème d'affectation généralisé ; national contribution of Italy

Martello, Silvano; Toth, Paolo - In: Operational research : OR ; proceedings of the IFORS … (1981), pp. 589-603

Persistent link: https://www.econbiz.de/10002463684

Branch and bound algorithms for the solution of the general unidimensional Knapsack problem

Martello, Silvano; Toth, Paolo - In: Advances in operations research : proceedings of EURO …, (pp. 295-301). 1977

Persistent link: https://www.econbiz.de/10002463688

A new algorithm for the travelling salesman problem with duedates

Carpaneto, Giorgio; Toth, Paolo - In: Advances in operations research : proceedings of EURO …, (pp. 95-102). 1977

Persistent link: https://www.econbiz.de/10001975308

A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem

Escobar, John Willmer; Linfati, Rodrigo; Baldoquin, Maria G. - In: Transportation Research Part B: Methodological 67 (2014) C, pp. 344-356

This paper proposes a new heuristic algorithm for the Capacitated Location-Routing Problem (CLRP), called Granular Variable Tabu Neighborhood Search (GVTNS). This heuristic includes a Granular Tabu Search within a Variable Neighborhood Search algorithm. The proposed algorithm is experimentally...

Persistent link: https://www.econbiz.de/10010907094

A note on exact algorithms for the bottleneck generalized assignment problem

Martello, Silvano; Toth, Paolo - In: European Journal of Operational Research 83 (1995) 3, pp. 711-712

Persistent link: https://www.econbiz.de/10005236826

An upper bound for the zero-one knapsack problem and a branch and bound algorithm

Martello, Silvano; Toth, Paolo - In: European Journal of Operational Research 1 (1977) 3, pp. 169-175

Persistent link: https://www.econbiz.de/10005239986