Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Johan Oppen"'
Publikováno v:
Communications, Vol 21, Iss 2, Pp 100-113 (2019)
The Cargo Mix Problem (CMP) chooses and distributes types of containers to load into bay subsections of a container vessel. In this paper, we extend existing Mixed Integer Programming models for the CMP by considering containers with dangerous goods.
Externí odkaz:
https://doaj.org/article/792164d607314ab7abac8ce0be62eb6a
Publikováno v:
Mendel, Vol 24, Iss 2 (2018)
In this paper we extend existing models for Master Bay Planning by handling containers holding dangerous goods, so-called IMO containers. Incompatible IMO containers must be separated from each other on board a vessel according to specic rules. These
Externí odkaz:
https://doaj.org/article/a25096c7fe664090a9ee54021554c285
Autor:
Johan Oppen
Publikováno v:
Communications, Vol 15, Iss 1, Pp 49-53 (2013)
This paper describes a combinatorial problem where the idea is to find out in how many ways a jigsaw puzzle can be built, piece by piece, in such a way that it stays connected at all times during the building phase. Computational methods, both exact
Externí odkaz:
https://doaj.org/article/fd45df53295046df8e7c08e1be823152
Autor:
Johan Oppen
Publikováno v:
Advances in Operations Research, Vol 2016 (2016)
We present a transportation problem representing a combination of liner and tramp shipping, where using other modes of transportation is also an option. As an example, we consider transportation of palletized frozen fish from Russia and Norway to ter
Externí odkaz:
https://doaj.org/article/d041cd3aa5974614a738b2e2029cc094
Publikováno v:
Communications - Scientific letters of the University of Zilina. 21:100-113
The Cargo Mix Problem (CMP) chooses and distributes types of containers to load into bay subsections of a container vessel. In this paper, we extend existing Mixed Integer Programming models for the CMP by considering containers with dangerous goods.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2fe81e06f85d37460684aa17c0a44034
https://doi.org/10.26552/com.c.2019.2.100-113
https://doi.org/10.26552/com.c.2019.2.100-113
Publikováno v:
Discrete Applied Mathematics. 253:153-166
This paper introduces a discrete relaxation for the class of combinatorial optimization problems which can be described by a set partitioning formulation under packing constraints. We present two combinatorial relaxations based on computing maximum w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aa094ea9f4fde274c05739c1e76d5501
https://doi.org/10.1016/j.dam.2018.05.033
https://doi.org/10.1016/j.dam.2018.05.033
Publikováno v:
Ambio
Application of fish sludge as fertiliser to agricultural land can contribute to closing nutrient cycles in fish farming. The effect of different treatment technologies on the nitrogen fertilisation effects of fish sludge was studied by a bioassay wit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7be807055e449453f9ad3d6a09119482
https://doi.org/10.1007/s13280-017-0927-5
https://doi.org/10.1007/s13280-017-0927-5
Publikováno v:
Electronic Notes in Discrete Mathematics. 55:85-88
We investigate an optimization problem in container ports, for which previous models based on generalized set partitioning formulations have been studied. We describe two combinatorial relaxations based on computing maximum weighted matchings in suit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::287abda68051195b7888795990bb4c23
https://doi.org/10.1016/j.endm.2016.10.022
https://doi.org/10.1016/j.endm.2016.10.022
Autor:
Johan Oppen
Publikováno v:
IFIP Advances in Information and Communication Technology ISBN: 9783030299958
APMS (2)
APMS (2)
In this paper we describe and solve a scheduling problem taken from the slaughterhouse industry. In an on-going research project, a new concept for slaughtering and cutting of pigs is developed. The idea is to replace the traditional production line
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::212499a0602f509ed7a3c4f8603d7d0b
https://doi.org/10.1007/978-3-030-29996-5_26
https://doi.org/10.1007/978-3-030-29996-5_26
Publikováno v:
Journal of the Operational Research Society
An important task of operators in Norwegian vessel traffic services (VTS) centres is to cleverly position tugboats before potential vessel distress calls. Here, we formulate a non-linear binary-integer program, integrated in a receding horizon contro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f347bc1906562c4b7d9156092d887534
http://hdl.handle.net/11250/2580296
http://hdl.handle.net/11250/2580296