Johan Oppen

According to our database, Johan Oppen authored at least 16 papers between 2006 and 2019.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2019

The matching relaxation for a class of generalized set partitioning problems.

Phillippe Samer, Evellyn Cavalcante, Sebastián Urrutia, Johan Oppen

Discret. Appl. Math., 2019

Optimizing Workflow in Cell-Based Slaughtering and Cutting of Pigs.

Johan Oppen

Proceedings of the Advances in Production Management Systems. Towards Smart Production Management Systems, 2019

2018

Strategies for Handling Temporal Uncertainty in Pickup and Delivery Problems with Time Windows.

F. Jordan Srour, Niels A. H. Agatz, Johan Oppen

Transp. Sci., 2018

Preventing environmental disasters from grounding accidents: A case study of tugboat positioning along the Norwegian coast.

Brice Assimizele, Johannes O. Royset, Robin T. Bye, Johan Oppen

J. Oper. Res. Soc., 2018

2016

Combinatorial Relaxation Bounds and Preprocessing for Berth Allocation Problems.

Evellyn Cavalcante, Johan Oppen, Phillippe Samer, Sebastián Urrutia

Electron. Notes Discret. Math., 2016

A Decomposition Approach to Solve The Quay Crane Scheduling Problem.

Afonso H. Sampaio, Sebastián Urrutia, Johan Oppen

CoRR, 2016

A combinatorial relaxation methodology for berth allocation problems.

Evellyn Cavalcante, Johan Oppen, Phillippe Samer, Sebastián Urrutia

CoRR, 2016

Decision Support for Flexible Liner Shipping.

Johan Oppen

Adv. Oper. Res., 2016

2015

A semi-greedy metaheuristic for the European cableway location problem.

Nils Egil Søvde, Arne Løkketangen, Richard L. Church, Johan Oppen

J. Heuristics, 2015

2014

Multi-stage scenario generation by the combined moment matching and scenario reduction method.

Uladzimir Rubasheuski, Johan Oppen, David L. Woodruff

Oper. Res. Lett., 2014

2013

A Sustainable Model For Optimal Dynamic Allocation Of Patrol Tugs To Oil Tankers.

Brice Assimizele, Johan Oppen, Robin T. Bye

Proceedings of the 27th European Conference on Modelling and Simulation, 2013

2011

Research note: the point of diminishing returns in heuristic search.

David L. Woodruff, Ulrike Ritzinger, Johan Oppen

Int. J. Metaheuristics, 2011

2010

Solving a rich vehicle routing and inventory problem using column generation.

Johan Oppen, Arne Løkketangen, Jacques Desrosiers

Comput. Oper. Res., 2010

2009

Parametric models of local search progression.

Johan Oppen, David L. Woodruff

Int. Trans. Oper. Res., 2009

2008

A tabu search approach for the livestock collection problem.

Johan Oppen, Arne Løkketangen

Comput. Oper. Res., 2008

2006

Arc routing in a node routing environment.

Johan Oppen, Arne Løkketangen

Comput. Oper. Res., 2006