Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Branch and bound methods for a search problem
Home
Publications
Branch and bound methods for a search problem
Branch and bound methods for a search problem
Author:
AW
Alan R. Washburn
Alan R. Washburn
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 April 1998
journal article
research article
Published by
Wiley
in
Naval Research Logistics (NRL)
Vol. 45
(3)
,
243-257
DOI:
10.1002/(sici)1520-6750(199804)45:3<243::aid-nav1>3.0.co;2-7
Abstract
No abstract available
Keywords
CHILDREN
OPTIMAL
BOUND METHODS
BRANCH
SUBMARINES
JOHN
TRADEOFF
SONS
IMPRECISE
EFFICIENT
Cited
Cited by 47 articles
Scroll to top