Spectrum: Concordia University Research Repository
metadata only
Solving layout compaction and wire-balancing problem using linear programming on the Monsoon multiprocessor
The theme of this work is parallel computing for a CAD application. The layout compaction and wire-balancing problem in VLSI physical design can be formulated as a dual transshipment problem (DTP) which can be written as a linear programming problem and solved using the network dual simplex (NDS) al
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
- Neutrosophic Treatment of Duality Linear Models and the Binary Simplex Algorithm#106396
- A bat algorithm to solve the manufacturing cell design problem [Resolución del Manufacturing Cell Design Problem utilizando el Algoritmo Bat]#948508
- Hardness and Approximation Algorithms for Balanced Districting Problems#1011993
- Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction#622493
- Improved Approximation Algorithms for the Multiple-Depot Split Delivery Vehicle Routing Problem#1122998
Record · ID 1020331
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