Similar Search Results

An improvement of the knapsack function based algorithm of Gilmore and Gomory for the unconstrained two-dimensional guillotine cutting problem

Russo, Mauro; Sforza, Antonio; Sterle, Claudio - In: International Journal of Production Economics 145 (2013) 2, pp. 451-462

In this paper we tackle the unconstrained non-staged guillotine two-dimensional cutting problem (U2DCP) with rectangular pieces and one rectangular stock sheet. This problem has been widely treated in literature by exact and heuristic solution methods which use the knapsack function introduced...

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

A cutting plane algorithm for the capacitated facility location problem

Avella, Pasquale; Boccia, Maurizio - In: Computational Optimization and Applications 43 (2009) 1, pp. 39-65

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

A computational study of exact knapsack separation for the generalized assignment problem

Avella, Pasquale; Boccia, Maurizio; Vasilyev, Igor - In: Computational Optimization and Applications 45 (2010) 3, pp. 543-555

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

A penalty function heuristic for the resource constrained shortest path problem

Avella, Pasquale; Boccia, Maurizio; Sforza, Antonio - In: European Journal of Operational Research 142 (2002) 2, pp. 221-230

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

Solving a fuel delivery problem by heuristic and exact approaches

Avella, Pasquale; Boccia, Maurizio; Sforza, Antonio - In: European Journal of Operational Research 152 (2004) 1, pp. 170-179

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

Single item reformulations for a vendor managed inventory routing problem: computational experience with benchmark instances

AVELLA, Pasquale; BOCCIA, Maurizio; WOLSEY, Laurence - Center for Operations Research and Econometrics (CORE), … - 2013

The Inventory Routing Problem (IRP) involves the distribution of one or more products from a supplier to a set of customers over a discrete planning horizon. The version treated here, the so- called Vendor Managed Inventory Routing Problem (VMIRP), is the Inventory Routing problem arising when...

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

Single-period cutting planes for inventory routing problems

AVELLA, Pasquale; BOCCIA, Maurizio; WOLSEY, Laurence A. - Center for Operations Research and Econometrics (CORE), … - 2014

IRP involves the distribution of one or more products from a supplier to a set of clients over a discrete planning horizon. Each client has a known demand to be met in each period and can only hold a limited amount of stock. The product is shipped through a distribution network by one or more...

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