Similar Search Results

Cutting stock problems with nondeterministic item lengths : a new approach to server consolidation

Martinovic, John; Hähnel, Markus; Scheithauer, Guntram; … - In: 4OR : a quarterly journal of operations research 17 (2019) 2, pp. 173-200

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

An introduction to stochastic bin packing-based server consolidation with conflicts

Martinovic, John; Hähnel, Markus; Scheithauer, Guntram; … - In: Top : an official journal of the Spanish Society of … 30 (2022) 2, pp. 296-331

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

Integer linear programming models for the skiving stock problem

Martinovic, John; Scheithauer, Guntram - In: European journal of operational research : EJOR 251 (2016) 2, pp. 356-368

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

Improved flow-based formulations for the skiving stock problem

Martinovic, John; Delorme, M.; Iori, M.; Scheithauer, … - In: Computers & operations research : and their … 113 (2020), pp. 1-18

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

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

Compact integer linear programming formulations for the temporal bin packing problem with fire-ups

Martinovic, John; Strasdat, N.; Selch, M. - In: Computers & operations research : and their … 132 (2021), pp. 1-26

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

Mathematical models and approximate solution approaches for the stochastic bin packing problem

Martinovic, John; Selch, M. - In: Computers & operations research : and their … 135 (2021), pp. 1-19

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

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

Minimal Proper Non-IRUP Instances of the One-Dimensional Cutting Stock Problem

Kartak, Vadim - 2014

We consider the well-known one dimensional cutting stock problem (1CSP). Based on the pattern structure of the classical ILP formulation of Gilmore and Gomory, we can decompose the infinite set of 1CSP instances, with a fixed demand n, into a finite number of equivalence classes. We show up a...

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

Tools of mathematical modeling of arbitrary object packing problems

Bennell, J. A.; Scheithauer, Guntram; Stoyan, Y.; … - 2010

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