default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohan Oppen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j12]Phillippe Samer
, Evellyn Cavalcante, Sebastián Urrutia, Johan Oppen:
The matching relaxation for a class of generalized set partitioning problems. Discret. Appl. Math. 253: 153-166 (2019)- [c2]Johan Oppen:
Optimizing Workflow in Cell-Based Slaughtering and Cutting of Pigs. APMS (2) 2019: 223-230 - 2018
- [j11]Brice Assimizele, Johannes O. Royset, Robin T. Bye, Johan Oppen:
Preventing environmental disasters from grounding accidents: A case study of tugboat positioning along the Norwegian coast. J. Oper. Res. Soc. 69(11): 1773-1792 (2018) - [j10]F. Jordan Srour, Niels A. H. Agatz, Johan Oppen:
Strategies for Handling Temporal Uncertainty in Pickup and Delivery Problems with Time Windows. Transp. Sci. 52(1): 3-19 (2018) - 2016
- [j9]Johan Oppen:
Decision Support for Flexible Liner Shipping. Adv. Oper. Res. 2016: 8710916:1-8710916:8 (2016) - [j8]Evellyn Cavalcante, Johan Oppen, Phillippe Samer, Sebastián Urrutia:
Combinatorial Relaxation Bounds and Preprocessing for Berth Allocation Problems. Electron. Notes Discret. Math. 55: 85-88 (2016) - [i2]Afonso H. Sampaio, Sebastián Urrutia, Johan Oppen:
A Decomposition Approach to Solve The Quay Crane Scheduling Problem. CoRR abs/1604.00527 (2016) - [i1]Evellyn Cavalcante, Johan Oppen, Phillippe Samer, Sebastián Urrutia:
A combinatorial relaxation methodology for berth allocation problems. CoRR abs/1606.09279 (2016) - 2015
- [j7]Nils Egil Søvde, Arne Løkketangen, Richard L. Church, Johan Oppen:
A semi-greedy metaheuristic for the European cableway location problem. J. Heuristics 21(5): 641-662 (2015) - 2014
- [j6]Uladzimir Rubasheuski, Johan Oppen, David L. Woodruff:
Multi-stage scenario generation by the combined moment matching and scenario reduction method. Oper. Res. Lett. 42(5): 374-377 (2014) - 2013
- [c1]Brice Assimizele, Johan Oppen, Robin T. Bye:
A Sustainable Model For Optimal Dynamic Allocation Of Patrol Tugs To Oil Tankers. ECMS 2013: 801-807 - 2011
- [j5]David L. Woodruff, Ulrike Ritzinger, Johan Oppen:
Research note: the point of diminishing returns in heuristic search. Int. J. Metaheuristics 1(3): 222-231 (2011) - 2010
- [j4]Johan Oppen, Arne Løkketangen, Jacques Desrosiers:
Solving a rich vehicle routing and inventory problem using column generation. Comput. Oper. Res. 37(7): 1308-1317 (2010)
2000 – 2009
- 2009
- [j3]Johan Oppen, David L. Woodruff:
Parametric models of local search progression. Int. Trans. Oper. Res. 16(5): 627-640 (2009) - 2008
- [j2]Johan Oppen, Arne Løkketangen:
A tabu search approach for the livestock collection problem. Comput. Oper. Res. 35(10): 3213-3229 (2008) - 2006
- [j1]Johan Oppen, Arne Løkketangen:
Arc routing in a node routing environment. Comput. Oper. Res. 33: 1033-1055 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
