default search action
Arne Løkketangen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j38]Santosh Kumar Mandal, Dario Pacciarelli
, Arne Løkketangen, Geir Hasle
A memetic NSGA-II for the bi-objective mixed capacitated general routing problem. J. Heuristics 21(3): 359-390 (2015) - [j37]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) - [j36]Sebastián Urrutia
A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks. Int. Trans. Oper. Res. 22(1): 61-75 (2015) - 2014
- [j35]Jianyong Jin, Teodor Gabriel Crainic
A cooperative parallel metaheuristic for the capacitated vehicle routing problem. Comput. Oper. Res. 44: 33-41 (2014) - [j34]Jorge Oyola
GRASP-ASP: An algorithm for the CVRP with route balancing. J. Heuristics 20(4): 361-382 (2014) - 2013
- [j33]Leyla Demir
Two approaches for solving the buffer allocation problem in unreliable production lines. Comput. Oper. Res. 40(10): 2556-2563 (2013) - [j32]Roland Olsson, Arne Løkketangen:
Using automatic programming to generate state-of-the-art algorithms for random 3-SAT. J. Heuristics 19(5): 819-844 (2013) - [j31]Marielle Christiansen, Geir Hasle
Guest Editorial: Special Issue on Advances in Vehicle Routing. Transp. Sci. 47(1): 1-2 (2013) - 2012
- [j30]Lars Magnus Hvattum, Arne Løkketangen, Fred W. Glover:
Comparisons of Commercial MIP Solvers and an Adaptive Memory (Tabu Search) Procedure for a Class of 0-1 Integer Programming Problems. Algorithmic Oper. Res. 7(1): 13-20 (2012) - [j29]Jianyong Jin, Teodor Gabriel Crainic
A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems. Eur. J. Oper. Res. 222(3): 441-451 (2012) - 2011
- [j28]Vinícius Amaral Armentano, André Luís Shiguemoto
Tabu search with path relinking for an integrated production-distribution problem. Comput. Oper. Res. 38(8): 1199-1209 (2011) - 2010
- [j27]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) - [j26]Henrik Andersson
Industrial aspects and literature survey: Combined inventory management and routing. Comput. Oper. Res. 37(9): 1515-1536 (2010) - [j25]Arild Hoff, Henrik Andersson
Industrial aspects and literature survey: Fleet composition and routing. Comput. Oper. Res. 37(12): 2041-2061 (2010) - [j24]Lars Magnus Hvattum
Alternating control tree search for knapsack/covering problems. J. Heuristics 16(3): 239-258 (2010) - [j23]Arild Hoff, Arnt-Gunnar Lium, Arne Løkketangen, Teodor Gabriel Crainic
A metaheuristic for stochastic service network design. J. Heuristics 16(5): 653-679 (2010) - [j22]Arne Løkketangen, Roland Olsson:
Generating meta-heuristic optimization code using ADATE. J. Heuristics 16(6): 911-930 (2010) - [j21]Marielle Christiansen, Geir Hasle
Call for Papers - Special Issue of Transportation Science: Advances in Vehicle Routing: Submission deadline: October 15, 2010 - Expected publication date: Spring 2012. Transp. Sci. 44(3): 428 (2010)
2000 – 2009
- 2009
- [j20]Rodrigo Moretti Branchini, Vinícius Amaral Armentano, Arne Løkketangen:
Adaptive granular local search heuristic for a dynamic vehicle routing problem. Comput. Oper. Res. 36(11): 2955-2968 (2009) - [j19]Arild Hoff, Irina Gribkovskaia Sr.
Lasso solution strategies for the vehicle routing problem with pickups and deliveries. Eur. J. Oper. Res. 192(3): 755-766 (2009) - [j18]Lars Magnus Hvattum
Using scenario trees and progressive hedging for stochastic inventory routing problems. J. Heuristics 15(6): 527-557 (2009) - [j17]Lars Magnus Hvattum
Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems. INFORMS J. Comput. 21(2): 268-285 (2009) - 2008
- [j16]Johan Oppen, Arne Løkketangen:
A tabu search approach for the livestock collection problem. Comput. Oper. Res. 35(10): 3213-3229 (2008) - [j15]Peter Greistorfer, Arne Løkketangen, Stefan Voß
Experiments concerning sequential versus simultaneous maximization of objective function and distance. J. Heuristics 14(6): 613-625 (2008) - 2007
- [j14]Teodor Gabriel Crainic
Editorial. J. Math. Model. Algorithms 6(1): 1-2 (2007) - [j13]Lars Magnus Hvattum
A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems. Networks 49(4): 330-340 (2007) - [c3]Arne Løkketangen:
The Importance of Being Careful. SLS 2007: 1-15 - [c2]Hideki Hashimoto, Youichi Ezaki, Mutsunori Yagiura, Koji Nonobe
A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route. SLS 2007: 192-196 - [p1]Lars Magnus Hvattum, Arne Løkketangen:
Experiments Using Scatter Search for the Multidemand Multidimensional Knapsack Problem. Metaheuristics 2007: 3-24 - 2006
- [j12]Arild Hoff, Arne Løkketangen:
Creating lasso-solutions for the traveling salesman problem with pickup and delivery by Tabu search. Central Eur. J. Oper. Res. 14(2): 125-140 (2006) - [j11]Johan Oppen, Arne Løkketangen:
Arc routing in a node routing environment. Comput. Oper. Res. 33: 1033-1055 (2006) - [j10]Halvard Arntzen, Lars Magnus Hvattum
Adaptive memory search for multidemand multidimensional knapsack problems. Comput. Oper. Res. 33: 2508-2525 (2006) - [j9]Geir Hasle
Rich models in discrete optimization: Formulation and resolution (ECCO XVI). Eur. J. Oper. Res. 175(3): 1752-1753 (2006) - [j8]Lars Magnus Hvattum
Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic. Transp. Sci. 40(4): 421-438 (2006) - 2005
- [j7]Arne Løkketangen, David L. Woodruff:
A distance function to support optimized selection decisions. Decis. Support Syst. 39(3): 345-354 (2005) - 2004
- [j6]Lars Magnus Hvattum
Adaptive memory search for Boolean optimization problems. Discret. Appl. Math. 142(1-3): 99-109 (2004) - 2001
- [j5]Kjetil K. Haugen
Progressive hedging as a meta-heuristic applied to stochastic lot-sizing. Eur. J. Oper. Res. 132(1): 116-122 (2001) - 2000
- [j4]Geir Hasle, Johan Haavardtun, Oddvar Kloster, Arne Løkketangen:
Interactive planning for sustainable forest management. Ann. Oper. Res. 95(1-4): 19-40 (2000)
1990 – 1999
- 1998
- [j3]Arne Løkketangen, Fred W. Glover:
Solving zero-one mixed integer programming problems using tabu search. Eur. J. Oper. Res. 106(2-3): 624-658 (1998) - 1996
- [j2]Arne Løkketangen, David L. Woodruff:
Progressive hedging and tabu search applied to mixed integer (0, 1) multistage stochastic programming. J. Heuristics 2(2): 111-128 (1996) - [c1]Arne Løkketangen, Fred W. Glover:
Surrogate constraint analysis-new heuristics and learning schemes for satisfiability problems. Satisfiability Problem: Theory and Applications 1996: 537-572 - 1995
- [j1]Arne Løkketangen:
Tabu Search - Using the Search Experience to Guide the Search Process. An Introduction with Examples. AI Commun. 8(2): 78-85 (1995)
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-10-07 21:13 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: