Narrow search
Showing 1 - 8 of 8
Cover Image
An exact algorithm for the dual bin packing problem
Labbé, Martine - 1993
Persistent link: https://www.econbiz.de/10000863408
Cover Image
Heuristic and exact algorithms for the interval min-max regret knapsack problem
Furini, Fabio; Iori, Manuel; Martello, Silvano; … - In: INFORMS journal on computing : JOC 27 (2015) 2, pp. 392-405
Persistent link: https://www.econbiz.de/10011291290
Cover Image
Lower and upper bounds for the non-linear generalized assignment problem
D'Ambrosio, Claudia; Martello, Silvano; Monaci, Michele - In: Computers & operations research : and their … 120 (2020), pp. 1-10
Persistent link: https://www.econbiz.de/10012236828
Cover Image
Relaxations and heuristics for the multiple non-linear separable knapsack problem
D'Ambrosio, Claudia; Martello, Silvano; Mencarelli, Luca - In: Computers & operations research : and their … 93 (2018), pp. 79-89
Persistent link: https://www.econbiz.de/10011814895
Cover Image
Heuristic algorithms for the general nonlinear separable knapsack problem
D'Ambrosio, Claudia; Martello, Silvano - In: Computers & operations research : and their … 38 (2011) 2, pp. 505-513
Persistent link: https://www.econbiz.de/10008669907
Cover Image
The assignment and loading transportation problem
Homsi, Gabriel; Jordan, Jeremy; Martello, Silvano; … - In: European journal of operational research : EJOR 289 (2021) 3, pp. 999-1007
Persistent link: https://www.econbiz.de/10012433321
Cover Image
Models and algorithms for packing rectangles into the smallest square
Martello, Silvano; Monaci, Michele - In: Computers & operations research : and their … 63 (2015), pp. 161-171
Persistent link: https://www.econbiz.de/10011344139
Cover Image
An iterated dual substitution approach for binary integer programming problems under the min-max regret criterion
Wu, Wei; Iori, Manuel; Martello, Silvano; Yagiura, Mutsunori - In: INFORMS journal on computing : JOC ; charting new … 34 (2022) 5, pp. 2523-2539
Persistent link: https://www.econbiz.de/10014325512