Log InRegister
Quick Links : The Mindat ManualThe Rock H. Currier Digital LibraryMindat Newsletter [Free Download]
Home PageAbout MindatThe Mindat ManualHistory of MindatCopyright StatusWho We AreContact UsAdvertise on Mindat
Donate to MindatCorporate SponsorshipSponsor a PageSponsored PagesMindat AdvertisersAdvertise on Mindat
Learning CenterWhat is a mineral?The most common minerals on earthInformation for EducatorsMindat ArticlesThe ElementsThe Rock H. Currier Digital LibraryGeologic Time
Minerals by PropertiesMinerals by ChemistryAdvanced Locality SearchRandom MineralRandom LocalitySearch by minIDLocalities Near MeSearch ArticlesSearch GlossaryMore Search Options
Search For:
Mineral Name:
Locality Name:
Keyword(s):
 
The Mindat ManualAdd a New PhotoRate PhotosLocality Edit ReportCoordinate Completion ReportAdd Glossary Item
Mining CompaniesStatisticsUsersMineral MuseumsClubs & OrganizationsMineral Shows & EventsThe Mindat DirectoryDevice SettingsThe Mineral Quiz
Photo SearchPhoto GalleriesSearch by ColorNew Photos TodayNew Photos YesterdayMembers' Photo GalleriesPast Photo of the Day GalleryPhotography

Walkowiak, Krzysztof M. (2004) A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks. Computational Optimization and Applications, 27 (2). 149-171 doi:10.1023/b:coap.0000008650.91314.59

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleA Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks
JournalComputational Optimization and Applications
AuthorsWalkowiak, Krzysztof M.Author
Year2004 (February)Volume27
Issue2
PublisherSpringer Science and Business Media LLC
DOIdoi:10.1023/b:coap.0000008650.91314.59Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID9538430Long-form Identifiermindat:1:5:9538430:0
GUID0
Full ReferenceWalkowiak, Krzysztof M. (2004) A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks. Computational Optimization and Applications, 27 (2). 149-171 doi:10.1023/b:coap.0000008650.91314.59
Plain TextWalkowiak, Krzysztof M. (2004) A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks. Computational Optimization and Applications, 27 (2). 149-171 doi:10.1023/b:coap.0000008650.91314.59
In(2004, February) Computational Optimization and Applications Vol. 27 (2) Springer Science and Business Media LLC

See Also

These are possibly similar items as determined by title/reference text matching only.

Walkowiak, Krzysztof (2008) Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks. Computational Optimization and Applications, 40 (2). 119-141 doi:10.1007/s10589-007-9077-1
Bergamaschi, Luca, Gondzio, Jacek, Zilli, Giovanni (2004) Preconditioning Indefinite Systems in Interior Point Methods for Optimization. Computational Optimization and Applications, 28 (2). 149-171 doi:10.1023/b:coap.0000026882.34332.1b
Bomze, Immanuel M., Locatelli, Marco (2004) Undominated d.c. Decompositions of Quadratic Functions and Applications to Branch-and-Bound Approaches. Computational Optimization and Applications, 28 (2). 227-245 doi:10.1023/b:coap.0000026886.61324.e4
Fortz, B., Labbé, M. (2004) Two-Connected Networks with Rings of Bounded Cardinality. Computational Optimization and Applications, 27 (2). 123-148 doi:10.1023/b:coap.0000008649.61438.6b
Walkowiak, Krzysztof (2005) Heuristic Algorithm for Anycast Flow Assignment in Connection-Oriented Networks. In Lecture Notes in Computer Science - Lecture Notes in Computer Science. Springer Berlin Heidelberg. doi:10.1007/11428862_180
Larsson, Torbjörn, Yuan, Di (2004) An Augmented Lagrangian Algorithm for Large Scale Multicommodity Routing. Computational Optimization and Applications, 27 (2). 187-215 doi:10.1023/b:coap.0000008652.29295.eb
Xu, Song (2004) A Non-Interior Path Following Method for Convex Quadratic Programming Problems with Bound Constraints. Computational Optimization and Applications, 27 (3). 285-303 doi:10.1023/b:coap.0000013060.16224.31
(2004) COAP Best Paper Award. Computational Optimization and Applications, 27 (1). 115pp. doi:10.1023/b:coap.0000005029.22801.b3
Blanc, X. (2004) Lower Bound for the Interatomic Distance in Lennard-Jones Clusters. Computational Optimization and Applications, 29 (1). 5-12 doi:10.1023/b:coap.0000039486.97389.87
Pan, Ping-Qi (2004) A Dual Projective Pivot Algorithm for Linear Programming. Computational Optimization and Applications, 29 (3). 333-346 doi:10.1023/b:coap.0000044185.69640.54
Linping, Sun (2004) Updating the Self-Scaling Symmetric Rank One Algorithm with Limited Memory for Large-Scale Unconstrained Optimization. Computational Optimization and Applications, 27 (1). 23-29 doi:10.1023/b:coap.0000004977.04103.fb
 
and/or  
Mindat.org is an outreach project of the Hudson Institute of Mineralogy, a 501(c)(3) not-for-profit organization.
Copyright © mindat.org and the Hudson Institute of Mineralogy 1993-2025, except where stated. Most political location boundaries are © OpenStreetMap contributors. Mindat.org relies on the contributions of thousands of members and supporters. Founded in 2000 by Jolyon Ralph.
To cite: Ralph, J., Von Bargen, D., Martynov, P., Zhang, J., Que, X., Prabhu, A., Morrison, S. M., Li, W., Chen, W., & Ma, X. (2025). Mindat.org: The open access mineralogy database to accelerate data-intensive geoscience research. American Mineralogist, 110(6), 833–844. doi:10.2138/am-2024-9486.
Privacy Policy - Terms & Conditions - Contact Us / DMCA issues - Report a bug/vulnerability Current server date and time: August 30, 2025 08:20:39
Go to top of page