Similar Search Results

Parallelisierung einer zweistufigen Metaheuristik für Tourenplanungsprobleme mit Zeitfenstern

Gehring, Hermann - 2001

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

Automatic adjoint differentiation for special functions involving expectations

Brito, José; Goloubentsev, Andrei; Goncharov, Evgeny - In: The journal of computational finance : JFC 27 (2023) 2, pp. 33-46

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

Deep clustering of the traveling salesman problem to parallelize its solution

Romanuke, Vadim V. - In: Computers & operations research : an international journal 165 (2024), pp. 1-20

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

Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting

Masone, Adriano; Russo, Mauro; Sterle, Claudio - In: Computers & operations research : an international journal 167 (2024), pp. 1-25

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

Space defragmentation for packing problems

Zhu, Wenbin; Zhang, Zhaoyi; Oon, Wee-Chong; Lim, Andrew - In: European Journal of Operational Research 222 (2012) 3, pp. 452-463

One of main difficulties of multi-dimensional packing problems is the fragmentation of free space into several unusable … into a continuous usable space, which potentially allows the packing of additional items. We illustrate the effectiveness … of this technique using the two- and three-dimensional bin packing problem, where the aim is to load all given items …

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

A prototype column generation strategy for the multiple container loading problem

Zhu, Wenbin; Huang, Weili; Lim, Andrew - In: European Journal of Operational Research 223 (2012) 1, pp. 27-39

The multiple container loading cost minimization problem (MCLCMP) is a practical and useful problem in the transportation industry, where products of various dimensions are to be loaded into containers of various sizes so as to minimize the total shipping cost. The MCLCMP can be naturally...

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

A new iterative-doubling Greedy–Lookahead algorithm for the single container loading problem

Zhu, Wenbin; Lim, Andrew - In: European Journal of Operational Research 222 (2012) 3, pp. 408-417

The aim of the Single Container Loading Problem (SCLP) is to pack three-dimensional boxes into a three-dimensional container so as to maximize the volume utilization of the container. We propose a new block building approach that constructs packings by placing one block (of boxes) at a time...

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

A reference length approach for the 3D strip packing problem

Wei, Lijun; Oon, Wee-Chong; Zhu, Wenbin; Lim, Andrew - In: European Journal of Operational Research 220 (2012) 1, pp. 37-47

In the three-dimensional strip packing problem (3DSP), we are given a container with an open dimension and a set of …

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

A constraint programming approach for a batch processing problem with non-identical job sizes

Malapert, Arnaud; Guéret, Christelle; Rousseau, … - In: European Journal of Operational Research 221 (2012) 3, pp. 533-545

This paper presents a constraint programming approach for a batch processing machine on which a finite number of jobs of non-identical sizes must be scheduled. A parallel batch processing machine can process several jobs simultaneously and the objective is to minimize the maximal lateness. The...

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

РАЗРАБОТКА ПЕРИФЕРИИ ПРОДУКТА НА ОСНОВЕ АНАЛИЗА ПОТРЕБИТЕЛЬСКИХ ПРЕДПОЧТЕНИЙ

НОСКОВА Е.В.; РОМАНОВА И.М.; … - In: Известия Дальневосточного … (2011) 3, pp. 39-49

Приводятся результаты анализа потребительских предпочтений на региональном рынке замороженных овощей. На основе анализа разработана периферия продукта:...

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