Circuit Partitioning Via Set Partitioning and Column Generation

DOI10.1287/OPRE.44.1.65zbMATH Open0847.90095OpenAlexW1979869516MaRDI QIDQ4883202FDOQ4883202

Authors: Moshe Eben-Chaime, Craig A. Tovey, Jane C. Ammons 

Publication date: 1 July 1996

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.44.1.65

Recommendations

• An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
• A discrete dynamic convexized method for VLSI circuit partitioning
• Complementary column generation and bounding approaches for set partitioning formulations
• A survey of VLSI circuit partitioning algorithms
• A genetic approach for network partitioning

zbMATH Keywords

set partitioningheuristic column generationlarge-scale electronic circuits

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Case-oriented studies in operations research (90B90) Integer programming (90C10)

Cited In (6)

• Joint vehicle assembly‐routing problems: An integrated modeling and optimization approach
• Circuit partitioning using mean field annealing
• All-integer column generation for set partitioning: basic principles and extensions
• Column-Generation in Integer Linear Programming
• Column-to-row operations on partitions: Garden of Eden partitions
• Genetic clustering algorithms.

This page was built for publication: Circuit Partitioning Via Set Partitioning and Column Generation

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