Lotte Berghman
Titel
Geciteerd door
Geciteerd door
Jaar
Efficient solutions for Mastermind using genetic algorithms
L Berghman, D Goossens, R Leus
Computers & operations research 36 (6), 1880-1885, 2009
632009
Optimal solutions for a dock assignment problem with trailer transportation
L Berghman, R Leus, F Spieksma
Annals of Operations Research 213 (1), 3-25, 2014
38*2014
The truck scheduling problem at crossdocking terminals-exclusive versus mixed mode
L Berghman, C Briand, R Leus, P Lopez
4th International Conference on Operations Research and Enterprise Systems …, 2015
182015
Practical solutions for a dock assignment problem with trailer transportation
L Berghman, R Leus
European Journal of Operational Research 246 (3), 787-799, 2015
16*2015
Finite element analysis of the microstructure of AlN–TiN composites
S Patel, R Vaish, N Sinha, CR Bowen
Strain 50 (3), 250-261, 2014
6*2014
Machine scheduling models for warehousing docking operations
L Berghman
KU Leuven, 2012
62012
Valid inequalities for a time-indexed formulation
L Berghman, FCR Spieksma
Operations Research Letters 43 (3), 268-272, 2015
32015
Solving a time-indexed formulation by preprocessing and cutting planes
L Berghman, F Spieksma, V t'Kindt
Available at SSRN 2437371, 2014
22014
A Lagrangian heuristic for a dock assignment problem with trailer transportation
L Berghman, R Leus
2010 IEEE International Conference on Industrial Engineering and Engineering …, 2010
22010
Computational experiments with a cutting-plane algorithm for a time-indexed formulation
L Berghman, F Spieksma
Available at SSRN 2164223, 2012
12012
Probleme de cross-docking en mode mixte
L Berghman, C Briand, R Leus, P Lopez
ROADEF 2012, congrès annuel de la Société française de Recherche …, 2012
12012
Solving a dock assignment problem as a three-stage flexible flow-shop problem
L Berghman, R Leus
2009 IEEE International Conference on Industrial Engineering and Engineering …, 2009
12009
Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes
V t'Kindt, L Berghman, F Spieksma
RAIRO-Operations Research, 2020
2020
Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes
L Berghman, F Spieksma, V T'Kindt
2018
Relaxation lagrangienne et flot maximal pour un problème de transbordement
L Berghman, C Briand, R Leus, P Lopez
ROADEF2016, Le congrès annuel de la société Française de Recherche …, 2016
2016
New (facet-defining) valid inequalities for a time-indexed formulation
L Berghman, F Spieksma, V t'Kindt
2014
Solving a dock assignment problem with trailer transportation using beam search
L Berghman, R Leus
ORBEL 25, 2011
2011
Competitive solutions for a dock assignment problem by means of Lagrangian relaxation
L Berghman, R Leus
PMS 2010, 2010
2010
Using lagrangian relaxation to solve a dock assignment problem
L Berghman, R Leus
ORBEL 24, 2010
2010
Study on the Surface Behaviour of Polyamide-6.6 Fibres Treated with Plasma. Unitex, nr. 3, 1998, pp. 32-34.
CD Radu, J Verschuren, P Kiekens
1998
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20