default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVicente Campos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j18]Rafael Martí
, Vicente Campos, Arild Hoff, Juanjo Peiró:
Heuristics for the min-max arc crossing problem in graphs. Expert Syst. Appl. 109: 100-113 (2018)- 2017
- [j17]Anna Martínez-Gavara, Dario Landa-Silva, Vicente Campos, Rafael Martí:
Randomized heuristics for the Capacitated Clustering Problem. Inf. Sci. 417: 154-168 (2017) - [j16]Anna Martínez-Gavara, Vicente Campos, Manuel Laguna, Rafael Martí:
Heuristic solution approaches for the maximum minsum dispersion problem. J. Glob. Optim. 67(3): 671-686 (2017) - 2016
- [j15]Ángel Corberán, Juanjo Peiró, Vicente Campos, Fred W. Glover, Rafael Martí:
Strategic oscillation for the capacitated hub location problem with modular links. J. Heuristics 22(2): 221-244 (2016) - 2015
- [j14]Anna Martínez-Gavara, Vicente Campos, Micael Gallego, Manuel Laguna, Rafael Martí:
Tabu search and GRASP for the capacitated clustering problem. Comput. Optim. Appl. 62(2): 589-607 (2015) - [j13]Rafael Martí, Vicente Campos, Mauricio G. C. Resende, Abraham Duarte:
Multiobjective GRASP with Path Relinking. Eur. J. Oper. Res. 240(1): 54-71 (2015) - 2014
- [j12]Vicente Campos, Rafael Martí, Jesús Sánchez-Oro, Abraham Duarte:
GRASP with path relinking for the orienteering problem. J. Oper. Res. Soc. 65(12): 1800-1813 (2014) - 2011
- [j11]Vicente Campos, Estefanía Piñana, Rafael Martí:
Adaptive memory programming for matrix bandwidth minimization. Ann. Oper. Res. 183(1): 7-23 (2011) - [j10]Rafael Martí, Juan José Pantrigo, Abraham Duarte, Vicente Campos, Fred W. Glover:
Scatter Search and Path Relinking : A Tutorial on the Linear Arrangement Problem. Int. J. Swarm Intell. Res. 2(2): 1-21 (2011)
2000 – 2009
- 2008
- [j9]Rafael Martí, Vicente Campos, Estefanía Piñana:
A branch and bound algorithm for the matrix bandwidth minimization. Eur. J. Oper. Res. 186(2): 513-528 (2008) - 2007
- [c1]Enrique Mota, Vicente Campos, Angel Corberán:
A New Metaheuristic for the Vehicle Routing Problem with Split Demands. EvoCOP 2007: 121-129 - 2006
- [j8]Carlos G. García-González, Dionisio Pérez-Brito, Vicente Campos, Rafael Martí:
Variable neighborhood search for the linear ordering problem. Comput. Oper. Res. 33(12): 3549-3565 (2006) - 2005
- [j7]Vicente Campos, Manuel Laguna, Rafael Martí:
Context-Independent Scatter and Tabu Search for Permutation Problems. INFORMS J. Comput. 17(1): 111-122 (2005) - 2004
- [j6]Estefanía Piñana, Isaac Plana, Vicente Campos, Rafael Martí:
GRASP and path relinking for the matrix bandwidth minimization. Eur. J. Oper. Res. 153(1): 200-210 (2004) - 2001
- [j5]Rafael Martí, Manuel Laguna, Fred W. Glover, Vicente Campos:
Reducing the bandwidth of a sparse matrix with tabu search. Eur. J. Oper. Res. 135(2): 450-459 (2001) - [j4]Vicente Campos, Fred W. Glover, Manuel Laguna, Rafael Martí:
An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem. J. Glob. Optim. 21(4): 397-414 (2001) - 2000
- [j3]Vicente Campos, Enrique Mota:
Heuristic Procedures for the Capacitated Vehicle Routing Problem. Comput. Optim. Appl. 16(3): 265-277 (2000)
1990 – 1999
- 1999
- [j2]Manuel Laguna, Rafael Martí, Vicente Campos:
Intensification and diversification with elite tabu search solutions for the linear ordering problem. Comput. Oper. Res. 26(12): 1217-1230 (1999) - 1992
- [j1]Enrique Benavent, Vicente Campos, Angel Corberán, Enrique Mota:
The Capacitated Arc Routing Problem: Lower bounds. Networks 22(7): 669-690 (1992)
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-25 05:49 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:
