Similar Search Results

Lower and upper bounding procedures for the bin packing problem with concave loading cost

Haouari, Mohamed; Mhiri, Mariem - In: European journal of operational research : EJOR 312 (2024) 1, pp. 56-69

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

A stochastic programming approach to the cutting stock problem with usable leftovers

Cherri, Adriana Cristina; Cherri, Luiz Henrique; … - In: European journal of operational research : EJOR 308 (2023) 1, pp. 38-53

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

Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns

Cui, Yaodong; Zhao, Zhigang - In: European Journal of Operational Research 231 (2013) 2, pp. 288-298

heuristic algorithm is presented to solve the rectangular two-dimensional single stock size cutting stock problem with two … reducing the number of plates used than a published algorithm and a commercial stock cutting software package. …

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

Solving robust bin-packing problems with a branch-and-price approach

Schepler, Xavier; Rossi, André; Gurevsky, Evgeny; … - In: European journal of operational research : EJOR 297 (2022) 3, pp. 831-843

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

Solving bin packing problems using VRPSolver models

Pessoa, Artur; Sadykov, Ruslan; Uchoa, Eduardo - In: Operations research forum 2 (2021) 2, pp. 1-25

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

A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function

Hu, Qian; Zhu, Wenbin; Hu, Qin; Lim, Andrew - In: European journal of operational research : EJOR 260 (2017) 1, pp. 70-80

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

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

An ε-constraint column generation-and-enumeration algorithm for Bi-Objective Vehicle Routing Problems

Glize, Estèle; Jozefowiez, Nicolas; Ngueveu, Sandra Ulrich - In: Computers & operations research : and their … 138 (2022), pp. 1-16

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

A combined column generation and heuristics for railway short-term rolling stock planning with regular inspection constraints

Nishi, Tatsushi; Ohno, Akiyoshi; Inuiguchi, Masahiro; … - In: Computers & operations research : and their … 81 (2017), pp. 14-25

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

Improved mathematical model and bounds for the crop rotation scheduling problem with adjacency constraints

Mauri, Geraldo Regis - In: European journal of operational research : EJOR 278 (2019) 1, pp. 120-135

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

1
2
3
4
5
6
7
8
9
10
Next
Last