default search action
Jan H. van Vuuren
Person information
- affiliation: Stellenbosch University, Matieland, South Africa
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j38]Günther Hüsselmann
, Jan Harm van Vuuren, S. J. Andersen:
An improved solution methodology for the urban transit routing problem. Comput. Oper. Res. 163: 106481 (2024) - [j37]Dirk Johan Coetzee Koegelenberg
A dynamic price jump exit and re-entry strategy for intraday trading algorithms based on market volatility. Expert Syst. Appl. 243: 122892 (2024) - 2023
- [j36]Hans Jurie Zietsman
A generic decision support framework for inventory procurement planning in distribution centres. Comput. Ind. Eng. 177: 109057 (2023) - 2022
- [j35]A. Smith, P. Toth, Louzanne Bam
A multi-tiered vehicle routing problem with global cross-docking. Comput. Oper. Res. 137: 105526 (2022) - [j34]Fuzail Dawood
Modelling the efficacy of a threshold-triggered control strategy for the invasive tree species Prosopis. Ecol. Informatics 71: 101793 (2022) - [j33]Jacqueline Kazmaier
The power of ensemble learning in sentiment analysis. Expert Syst. Appl. 187: 115819 (2022) - 2021
- [j32]Rosephine G. Rakotonirainy
The effect of benchmark data characteristics during empirical strip packing heuristic performance evaluation. OR Spectr. 43(2): 467-495 (2021) - [j31]Christa Searle
Modelling forced migration: A framework for conflict-induced forced migration modelling according to an agent-based approach. Comput. Environ. Urban Syst. 85: 101568 (2021) - [j30]Pierre Cilliers, Jan Harm van Vuuren
A framework for modelling spatio-temporal informal settlement growth prediction. Comput. Environ. Urban Syst. 90: 101707 (2021) - 2020
- [j29]Rosephine G. Rakotonirainy
Improved metaheuristics for the two-dimensional strip packing problem. Appl. Soft Comput. 92: 106268 (2020) - [j28]Jacqueline Kazmaier
A generic framework for sentiment analysis: Leveraging opinion-bearing data to inform decision making. Decis. Support Syst. 135: 113304 (2020)
2010 – 2019
- 2018
- [j27]E. B. Schlünz, Pavel M. Bokov, Jan H. van Vuuren
Multiobjective in-core nuclear fuel management optimisation by means of a hyperheuristic. Swarm Evol. Comput. 42: 58-76 (2018) - 2016
- [j26]E. B. Schlünz, Pavel M. Bokov, Jan H. van Vuuren
A comparative study on multiobjective metaheuristics for solving constrained in-core fuel management optimisation problems. Comput. Oper. Res. 75: 174-190 (2016) - [j25]Jan H. van Vuuren
Edge Criticality in Graph Domination. Graphs Comb. 32(2): 801-811 (2016) - [j24]Andries M. Heyns
A multi-resolution approach towards point-based multi-objective geospatial facility location. Comput. Environ. Urban Syst. 57: 80-92 (2016) - 2015
- [j23]Alewyn P. Burger, Anton Pierre de Villiers, Jan H. van Vuuren
Edge criticality in secure graph domination. Discret. Optim. 18: 111-122 (2015) - [j22]Anton Pierre de Villiers, Alewyn Petrus Burger, Jan Harm van Vuuren:
Edge stability in secure graph domination. Discret. Math. Theor. Comput. Sci. 17(1): 103-122 (2015) - [j21]Alewyn P. Burger, C. G. Jacobs, Jan H. van Vuuren
Scheduling multi-colour print jobs with sequence-dependent setup times. J. Sched. 18(2): 131-145 (2015) - 2014
- [j20]Alewyn P. Burger, Anton Pierre de Villiers, Jan H. van Vuuren
A linear algorithm for secure domination in trees. Discret. Appl. Math. 171: 15-27 (2014) - [j19]Adriana Roux
Upper bounds on the balanced 〈r, s〉-domination number of a graph. Discret. Appl. Math. 179: 214-221 (2014) - 2013
- [j18]Francois Fagan, Jan H. van Vuuren:
A unification of the prevalent views on exploitation, exploration, intensification and diversification. Int. J. Metaheuristics 2(3): 294-327 (2013) - 2012
- [j17]Alewyn P. Burger, M. van der Merwe, Jan H. van Vuuren
An asymptotic analysis of the evolutionary spatial prisoner's dilemma on a path. Discret. Appl. Math. 160(15): 2075-2088 (2012) - [j16]I. Nieuwoudt, Jan H. van Vuuren
Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable. J. Sched. 15(6): 681-702 (2012) - 2011
- [j15]Alewyn P. Burger, Martin Philip Kidd, Jan H. van Vuuren
A graph-theoretic proof of the non-existence of self-orthogonal Latin squares of order 6. Discret. Math. 311(13): 1223-1228 (2011) - [j14]Alewyn P. Burger, Jan H. van Vuuren:
Avoidance colourings for small nonclassical Ramsey numbers. Discret. Math. Theor. Comput. Sci. 13(2): 81-96 (2011) - 2010
- [j13]Alewyn P. Burger, Martin Philip Kidd, Jan H. van Vuuren:
Enumeration of isomorphism classes of self-orthogonal Latin squares. Ars Comb. 97 (2010) - [j12]Frank G. Ortmann, Nthabiseng Ntene, Jan H. van Vuuren
New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems. Eur. J. Oper. Res. 203(2): 306-315 (2010)
2000 – 2009
- 2009
- [j11]Nthabiseng Ntene, Jan H. van Vuuren
A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem. Discret. Optim. 6(2): 174-188 (2009) - [j10]Alewyn P. Burger, Michael A. Henning, Jan H. van Vuuren
On the ratios between packing and domination parameters of a graph. Discret. Math. 309(8): 2473-2478 (2009) - [j9]Darian Raad, Alexander Sinske, Jan H. van Vuuren
Robust multi-objective optimization for water distribution system design using a meta-metaheuristic. Int. Trans. Oper. Res. 16(5): 595-626 (2009) - 2008
- [j8]Alewyn P. Burger, Jan H. van Vuuren:
On the (r, s) domination number of a graph. Ars Comb. 88 (2008) - 2007
- [j7]Alewyn P. Burger, W. R. Grundlingh, Jan H. van Vuuren:
Towards a Characterisation of Lottery Set Overlapping Structures. Ars Comb. 84 (2007) - [j6]Alewyn P. Burger, Jan H. van Vuuren
Balanced minimum covers of a finite set. Discret. Math. 307(22): 2853-2860 (2007) - [j5]M. J. Bester, I. Nieuwoudt, Jan H. van Vuuren
Finding good nurse duty schedules: a case study. J. Sched. 10(6): 387-405 (2007) - 2005
- [j4]Jan H. van Vuuren
Lions in the Kgalagadi Transfrontier Park: modelling the effect of human-caused mortality. Int. Trans. Oper. Res. 12(2): 145-171 (2005) - [j3]G. W. Groves, J. le Roux, Jan H. van Vuuren
On a routing and scheduling problem concerning multiple edge traversals in graphs. Networks 46(2): 69-81 (2005) - 2004
- [j2]Alewyn P. Burger, Jan H. van Vuuren
Ramsey numbers in complete balanced multipartite graphs. Part I: Set numbers. Discret. Math. 283(1-3): 37-43 (2004) - [j1]Alewyn P. Burger, Jan H. van Vuuren
Ramsey numbers in complete balanced multipartite graphs. Part II: Size numbers. Discret. Math. 283(1-3): 45-59 (2004)
Coauthor Index
aka: Alewyn Petrus Burger
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-09-09 00:18 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: