default search action
J. Wesley Barnes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j19]August G. Roesener
, J. Wesley Barnes:
An advanced tabu search approach to the dynamic airlift loading problem. Logist. Res. 9(1): 12:1-12:18 (2016) - 2015
- [j18]Dennis P. Michalopoulos, J. Wesley Barnes, David P. Morton
Prioritized interdiction of nuclear smuggling via tabu search. Optim. Lett. 9(8): 1477-1494 (2015) - 2010
- [j17]Michael Ciarleglio, J. Wesley Barnes, Sahotra Sarkar:
ConsNet - A tabu search approach to the spatially coherent conservation area network design problem. J. Heuristics 16(4): 537-557 (2010)
2000 – 2009
- 2009
- [j16]B. Dimova, J. Wesley Barnes, Elmira Popova, Bruce W. Colletti:
Some additional properties of elementary landscapes. Appl. Math. Lett. 22(2): 232-235 (2009) - 2006
- [j15]B. Dimova, J. Wesley Barnes, Elmira Popova:
The characteristic landscape equation for an AR(2) landscape. Appl. Math. Lett. 19(3): 260-266 (2006) - 2005
- [j14]B. Dimova, J. Wesley Barnes, Elmira Popova:
Arbitrary elementary landscapes & AR(1) processes. Appl. Math. Lett. 18(3): 287-292 (2005) - [j13]Jeriad Zoghby, J. Wesley Barnes, John J. Hasenbein:
Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches. Eur. J. Oper. Res. 167(2): 336-348 (2005) - 2003
- [j12]J. Wesley Barnes, B. Dimova, Steftcho P. Dokov
The theory of elementary landscapes. Appl. Math. Lett. 16(3): 337-343 (2003) - [j11]Andrew Solomon, J. Wesley Barnes, Steftcho P. Dokov
Weakly symmetric graphs, elementary landscapes, and the TSP. Appl. Math. Lett. 16(3): 401-407 (2003) - 2002
- [j10]J. Wesley Barnes, Bruce W. Colletti, David L. Neuway:
Using group theory and transition matrices to study a class of metaheuristic neighborhoods. Eur. J. Oper. Res. 138(3): 531-544 (2002) - 2001
- [j9]J. Wesley Barnes, Bruce W. Colletti:
Local search structure in the symmetric travelling salesperson problem under a general class of rearrangement neighborhoods. Appl. Math. Lett. 14(1): 105-108 (2001) - 2000
- [j8]Bruce W. Colletti, J. Wesley Barnes:
Linearity in the Traveling Salesman Problem. Appl. Math. Lett. 13(3): 27-32 (2000)
1990 – 1999
- 1999
- [j7]Bruce W. Colletti, J. Wesley Barnes, Steftcho P. Dokov
A Note on Characterizing the k-OPT Neighborhood Via Group Theory. J. Heuristics 5(1): 47-51 (1999) - 1993
- [j6]J. Wesley Barnes, Manuel Laguna:
A tabu search experience in production scheduling. Ann. Oper. Res. 41(3): 139-156 (1993) - [j5]Manuel Laguna, J. Wesley Barnes, Fred W. Glover:
Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequence-dependent setup costs and times. Appl. Intell. 3(2): 159-172 (1993) - [j4]Kevin D. Seppi, J. Wesley Barnes, Carl N. Morris:
A Bayesian Approach to Database Query Optimization. INFORMS J. Comput. 5(4): 410-419 (1993) - 1991
- [j3]Manuel Laguna, J. Wesley Barnes, Fred W. Glover:
Tabu search methods for a single machine scheduling problem. J. Intell. Manuf. 2(2): 63-73 (1991)
1980 – 1989
- 1982
- [j2]Stephen R. Schmidt, Paul A. Jensen, J. Wesley Barnes:
An advanced dual incremental network algorithm. Networks 12(4): 475-492 (1982) - 1981
- [j1]J. Wesley Barnes, Lawrence K. Vanston:
Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs. Oper. Res. 29(1): 146-160 (1981)
1970 – 1979
- 1971
- [c1]J. Wesley Barnes, Robert M. Crisp Jr.:
Simulation of the four-way and two-way stop sign controlled intersections. WSC 1971: 206-216
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:47 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: