arXiv (All)
open access
Efficient Graph Partitioning under Resource Constraints: A Cutting-Plane Framework for Distribution Grids
This paper presents an optimal network topology control framework using cutting-plane methods for efficient network partitioning with controllable edges. The objective is to enable real-time reconfiguration of interconnected subnetworks while ensuring radial connectivity, resource feasibility, and s
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Conservative Hybrid Graph Networks for Process Systems with Learned Routing#793129
- Conservative Hybrid Graph Networks for Process Systems with Learned Routing#789125
- Network Information Center schedule for network users#136929
- Minimal Construction of Graphs with Maximum Robustness#971697
- 15 CFR Part 700 — Defense Priorities and Allocations System#505922
Record · ID 1048642
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive