default search action
Brian Boffey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [j18]Brian Boffey, Roberto D. Galvão, Vladimir Marianov
:
Location of single-server immobile facilities subject to a loss constraint. J. Oper. Res. Soc. 61(6): 987-999 (2010)
2000 – 2009
- 2009
- [j17]Vladimir Marianov
Optimal location of multi-server congestible facilities operating as M/E r/m/N queues. J. Oper. Res. Soc. 60(5): 674-684 (2009) - 2008
- [j16]S. Arifusalem, Stefano Benati
New trends in locational analysis. Comput. Oper. Res. 35(3): 649-650 (2008) - [j15]T. Brian Boffey, Juan A. Mesa, Francisco A. Ortega
Locating a low-level waste disposal site. Comput. Oper. Res. 35(3): 701-716 (2008) - [c2]Carolin I. Bauer, H. Yu, Brian Boffey:
Adaptive Genetic Algorithm for Neural Network Retraining. TeNe 2008: 235-238 - 2007
- [j14]Brian Boffey, Roberto D. Galvão, Luis Gonzalo Acosta Espejo:
A review of congestion models in the location of facilities with immobile servers. Eur. J. Oper. Res. 178(3): 643-662 (2007) - 2006
- [j13]Roberto D. Galvão, Luis Gonzalo Acosta Espejo, Brian Boffey:
Practical aspects associated with location planning for maternal and perinatal assistance in Brazil. Ann. Oper. Res. 143(1): 31-44 (2006) - [j12]Roberto D. Galvão, Luis Gonzalo Acosta Espejo, Brian Boffey, Derek F. Yates:
Load balancing and capacity constraints in a hierarchical location model. Eur. J. Oper. Res. 172(2): 631-646 (2006) - 2003
- [j11]Luis Gonzalo Acosta Espejo, Roberto D. Galvão, Brian Boffey:
Dual-based heuristics for a hierarchical covering location problem. Comput. Oper. Res. 30(2): 165-180 (2003) - [j10]Brian Boffey, Derek F. Yates, Roberto D. Galvão:
An algorithm to locate perinatal facilities in the municipality of Rio de Janeiro. J. Oper. Res. Soc. 54(1): 21-31 (2003) - 2002
- [j9]Roberto D. Galvão, Luis Gonzalo Acosta Espejo, Brian Boffey:
A hierarchical model for the location of perinatal facilities in the municipality of Rio de Janeiro. Eur. J. Oper. Res. 138(3): 495-517 (2002) - [j8]T. Brian Boffey, R. C. Williams, Blas Pelegrín, Pascual Fernández
The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets. RAIRO Oper. Res. 36(1): 1-19 (2002) - 2000
- [j7]Saïd Salhi, Brian Boffey:
Editorial. Eur. J. Oper. Res. 121(2): 217 (2000) - [j6]Roberto D. Galvão, Luis Gonzalo Acosta Espejo, Brian Boffey:
A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem. Eur. J. Oper. Res. 124(2): 377-389 (2000)
1990 – 1999
- 1998
- [j5]Brian Boffey, Subhash C. Narula:
Models for multi-path covering-routing problems. Ann. Oper. Res. 82: 331-342 (1998) - 1994
- [j4]Charles J. Colbourn, Louis D. Nel, T. Brian Boffey, Derek F. Yates:
Network reliability and the probabilistic estimation of damage from fire spread. Ann. Oper. Res. 50(1): 173-185 (1994) - 1993
- [j3]T. Brian Boffey, W. A. Essah:
Implementing a Parallel Constrained l_1 Approximation Algorithm. Parallel Comput. 19(6): 609-620 (1993)
1980 – 1989
- 1983
- [j2]T. Brian Boffey, J. R. Green:
Design of electricity supply networks. Discret. Appl. Math. 5(1): 25-38 (1983)
1970 – 1979
- 1973
- [j1]T. Brian Boffey:
Applying the Minimax Rule Over Graphs Which Are Not Trees. Inf. Process. Lett. 2(3): 79-81 (1973) - [c1]T. Brian Boffey:
Some Theoretical Results Concerning Automated Game-Playing. IJCAI 1973: 18-22
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:46 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: