Similar Search Results

Solving the three-dimensional open-dimension rectangular packing problem : a constraint programming model

Martin, Mateus; Queiroz, Thiago Alves de; Morabito, Reinaldo - In: Computers & operations research : an international journal 167 (2024), pp. 1-12

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

How to load your auto carrier : a hybrid packing approach for the auto-carrier loading problem

Jäck, Christian; Gönsch, Jochen - In: European journal of operational research : EJOR 315 (2024) 3, pp. 1167-1181

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

Tighter bounds for the harmonic bin packing algorithm

Epstein, Leah - In: European journal of operational research : EJOR 316 (2024) 1, pp. 72-84

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

Iterated dynamic thresholding search for packing equal circles into a circular container

Lai, Xiangjing; Hao, Jin-Kao; Yue, Dong; Lü, Zhipeng; … - In: European journal of operational research : EJOR 299 (2022) 1, pp. 137-153

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

The value of integration of full container load, less than container load and air freight shipments in vendor-managed inventory systems

Bertazzi, Luca; Moezi, Sarem Deilami; Maggioni, Francesca - In: International journal of production economics 241 (2021), pp. 1-10

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

A residual recombination heuristic for one-dimensional cutting stock problems

Campello, B.S.C.; Ghidini, C.T.L.S.; Ayres, A.O.C.; … - In: Top : an official journal of the Spanish Society of … 30 (2022) 1, pp. 194-220

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

A note on the integrality gap of cutting and skiving stock instances : why 4/3 is an upper bound for the divisible case?

Martinovic, John - In: 4OR : quarterly journal of the Belgian, French and … 20 (2022) 1, pp. 85-104

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

An Articulation Point Based Heuristic Algorithm for Minimum Weight Vertex Cover Problem

Mastan, Shaik; Balakrishna, U.; Raju, G. Sankar Sekhar; … - 2021

The minimum weight vertex cover problem (MWVCP) is well known combinatorial optimization problem that has several practical applications and formally defined as: Given an undirected graph with a set of vertices and edges, each vertex is assigned bya positive weight, the MWVCP aims to find a...

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

Models and algorithms for the bin-packing problem with minimum color fragmentation

Mehrani, Saharnaz; Cardonha, Carlos; Bergman, David - In: INFORMS journal on computing : JOC ; charting new … 34 (2022) 2, pp. 1070-1085

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

The multiple container loading problem with loading docks

Rajaei, Maryam; Moslehi, Ghasem; Reisi-Nafchi, Mohammad - In: International transactions in operational research : a … 31 (2024) 3, pp. 1671-1698

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