Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

The Complexity of DC-Switching Problems

Simple item page
dc.contributor.authorLehmann, Karsten
dc.contributor.authorGrastien, Alban
dc.contributor.authorVan Hentenryck, Pascal
dc.date.accessioned2023-11-20T03:04:10Z
dc.date.issued2014
dc.date.updated2022-08-07T08:18:42Z
dc.description.abstractThis report provides a comprehensive complexity study of line switching in the Linear DC model for the feasibility problem and the optimization problems of maximizing the load that can be served (maximum switching flow, MSF) and minimizing generation cost (optimal transmission switching, OTS). Our results show that these problems are NP-complete and that there is no fully polynomial-time approximation scheme for planar networks with a maximum-node degree of 3. Additionally, we demonstrate that the problems are still NP-hard if we restrict the network structure to cacti with a maximum degree of 3. We also show that the optimization problems can not be approximated within any constant factor.en_AU
dc.description.sponsorshipThis report was commisioned by NICTAen_AU
dc.format.mimetypeapplication/pdfen_AU
dc.identifier.issn1833-9646en_AU
dc.identifier.urihttp://hdl.handle.net/1885/306402
dc.language.isoen_AUen_AU
dc.publisherNational ICT Australia (NICTA)en_AU
dc.rights© 2014 NICTAen_AU
dc.source.urihttps://arxiv.org/pdf/1411.4369.pdfen_AU
dc.titleThe Complexity of DC-Switching Problemsen_AU
dc.typeJournal articleen_AU
dcterms.accessRightsFree Access via publisher websiteen_AU
local.bibliographicCitation.lastpage13en_AU
local.bibliographicCitation.placeofpublicationAustralia
local.bibliographicCitation.startpage1en_AU
local.contributor.affiliationLehmann, Karsten, College of Engineering and Computer Science, ANUen_AU
local.contributor.affiliationGrastien, Alban, College of Engineering and Computer Science, ANUen_AU
local.contributor.affiliationVan Hentenryck, Pascal, College of Engineering and Computer Science, ANUen_AU
local.contributor.authoruidLehmann, Karsten, u5105743en_AU
local.contributor.authoruidGrastien, Alban, u1818576en_AU
local.contributor.authoruidVan Hentenryck, Pascal, u5136864en_AU
local.description.embargo2099-12-31
local.description.notesImported from ARIESen_AU
local.identifier.absfor460609 - Networking and communicationsen_AU
local.identifier.ariespublicationu4334215xPUB1450en_AU
local.type.statusPublished Versionen_AU

Downloads

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TheComplexityofDC-SwitchingProblems.pdf
Size:
479.43 KB
Format:
Adobe Portable Document Format
Description:
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS

abcd