Performance-driven layer assignment by integer linear programming and path-constrained hypergraph partitioning

DOI10.1023/A:1009683110027zbMATH Open1071.90584OpenAlexW1592658197MaRDI QIDQ2567851

Yanyan Li

Publication date: 13 October 2005

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009683110027

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)

Recommendations

• Parallel multilevel algorithms for hypergraph partitioning 👍 👎
• Efficient algorithms for single- and two-layer linear placement of parallel graphs 👍 👎
• Path optimization for graph partitioning problems 👍 👎
• Layered graph approaches for combinatorial optimization problems 👍 👎
• Optimizing Vertex Pressure Dynamic Graph Partitioning in Many-Core Systems 👍 👎
• Network Flow-Based Refinement for Multilevel Hypergraph Partitioning 👍 👎
• Parallel Processing and Applied Mathematics 👍 👎
• Deterministic Parallel Hypergraph Partitioning 👍 👎

This page was built for publication: Performance-driven layer assignment by integer linear programming and path-constrained hypergraph partitioning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2567851)