Narrow search
Showing 1 - 7 of 7
Cover Image
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
Furini, Fabio; Ljubić, Ivana; Sinnl, Markus - In: European journal of operational research : EJOR 262 (2017) 2, pp. 438-448
Persistent link: https://www.econbiz.de/10011798731
Cover Image
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
Furini, Fabio; Malaguti, Enrico; Durán, Rosa Medina; … - In: European journal of operational research : EJOR 218 (2012) 1, pp. 251-260
Persistent link: https://www.econbiz.de/10009501043
Cover Image
Models for the two-dimensional two-stage cutting stock problem with multiple stock size
Furini, Fabio; Malaguti, Enrico - In: Computers & operations research : and their … 40 (2013) 8, pp. 1953-1962
Persistent link: https://www.econbiz.de/10009765455
Cover Image
A lexicographic pricer for the fractional bin packing problem
Coniglio, Stefano; D'Andreagiovanni, Fabio; Furini, Fabio - In: Operations research letters 47 (2019) 6, pp. 622-628
Persistent link: https://www.econbiz.de/10012131902
Cover Image
A branch-and-price algorithm for the temporal bin packing problem
Dell'Amico, Mauro; Furini, Fabio; Iori, Manuel - In: Computers & operations research : and their … 114 (2020), pp. 1-16
Persistent link: https://www.econbiz.de/10012146637
Cover Image
A numerically exact algorithm for the bin-packing problem
Baldacci, Roberto; Coniglio, Stefano; Cordeau, … - In: INFORMS journal on computing : JOC ; charting new … 36 (2024) 1, pp. 141-162
Persistent link: https://www.econbiz.de/10014474872
Cover Image
A combinatorial flow-based formulation for temporal bin packing problems
Martinovic, John; Strasdat, Nico; Carvalho, José … - In: European journal of operational research : EJOR 307 (2023) 2, pp. 554-574
Persistent link: https://www.econbiz.de/10014334796