Search Results - subject:"Loading problem"

Branch-and-price and beam search algorithms for the Variable Cost and Size Bin Packing Problem with optional items

Baldi, Mauro Maria; Crainic, Teodor Gabriel; Perboli, Guido - In: ORP 3 - OR for young researchers and practitioners, (pp. 125-141). 2014

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

A hybrid evolutionary algorithm for the two-dimensional packing problem

Kierkosz, Igor; Luczak, Maciej - In: Central European journal of operations research : CEJOR … 22 (2014) 4, pp. 729-753

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

The assortment packing problem : multiperiod assortment planning for short-lived products

Caro, Felipe; Martínez-de-Albéniz, Victor; … - In: Management science : journal of the Institute for … 60 (2014) 11, pp. 2701-2721

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

A multi-scenario model for empty container repositioning with uncertain demand

Di Francesco, Massimo; Lai, Michela; Zuddas, Paola - In: International journal of services and operations management 19 (2014) 2, pp. 212-228

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

A partitioning algorithm for the network loading problem

BABONNEAU, Frédéric; VIAL, Jean-Philippe - Center for Operations Research and Econometrics (CORE), … - 2007

This paper proposes a Benders-like partitioning algorithm to solve the network loading problem. The effort of computing …2007/91 ■ A partitioning algorithm for the network loading problem Frédéric Babonneau and Jean …-Philippe Vial CORE DISCUSSION PAPER 207/91 A partitioning algorithm for the network loading problem Frédéric BABONEAU 1 …

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

The two-dimensional cutting stock problem within the roller blind production process

Gelder, E.R. de (contributor); … - 2007

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

On the Sum-of-Squares Algorithm for Bin Packing

Csirik, Janos - 2006

In this paper we present a theoretical analysis of the on-line Sum-of-Squares algorithm (SS) for bin packing along with several new variants. SS is applicable to any instance of bin packing in which the bin capacity B and item sizes s(a) are integral (or can be scaled to be so), and runs in time...

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

Parallel greedy algorithms for packing unequal circles into a strip or a rectangle

Kubach, Timo - 2006

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

C & P software for a cutting problem of a German wood panel manufacturer : a case study

Papke, Tracy - 2006

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

Optimizing fire station locations for the Istanbul Metropolitan Municipality

Aktaş, Emel; Özaydın, Özay; Bozkaya, Burçin; … - In: Interfaces : the INFORMS journal on the practice of … 43 (2013) 3, pp. 240-255

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