Skip to content
Open Access
  • Home
  • Collections
    • High Impact Articles
    • Jawi Collection
    • Malay Medicine
    • Forensic
  • Search Options
    • UiTM Open Access
    • Search by UiTM Scopus
    • Advanced Search
    • Search by Category
  • Discovery Service
    • Sources
    • UiTM Journals
    • List UiTM Journal in IR
    • Statistic
  • About
    • Open Access
    • Creative Commons Licenses
    • COKI | Malaysia Open Access
    • User Guide
    • Contact Us
    • Search Tips
    • FAQs
Advanced
  • Search
  • Minimal disconnecting sets in...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
Minimal disconnecting sets in directed multi-commodity networks

Minimal disconnecting sets in directed multi-commodity networks

Bibliographic Details
Main Author: Tindall, John Benton
Published: Georgia Institute of Technology 2008
Subjects:
Integer programming
Electric networks
Online Access:http://hdl.handle.net/1853/25021
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

http://hdl.handle.net/1853/25021

Similar Items

  • Optimal Design of Electric Bus Transport Systems With Minimal Total Ownership Cost
    by: Mohamed Lotfi, et al.
    Published: (2020-01-01)
  • Community Structure Detection for Directed Networks through Modularity Optimisation
    by: Lingjian Yang, et al.
    Published: (2016-11-01)
  • Multicommodity Network Flows: A Survey, Part I: Applications and Formulations
    by: I-Lin Wang
    Published: (2018-12-01)
  • Multicommodity Network Flows: A Survey, Part II: Solution Methods
    by: I-Lin Wang
    Published: (2018-12-01)
  • An algorithm for the solution of the general set-covering problem by Euclidean means
    by: Cullen, Frank Haywood
    Published: (2008)

© 2020 | Services hosted by the Perpustakaan Tun Abdul Razak, | Universiti Teknologi MARA | Disclaimer


Loading...