Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits
From MaRDI portal
Publication:1327559
DOI10.1007/BF01582072zbMath0801.90079OpenAlexW2005064625MaRDI QIDQ1327559
Robert Weismantel, Michael Jünger, Alexander Martin, Gerhard Reinelt
Publication date: 1 December 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582072
NP-hardnessVLSI-designlayout design of electronic circuits\(\varepsilon\)-approximative algorithmsquadratic 0/1 optimization
Applications of mathematical programming (90C90) Quadratic programming (90C20) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Boolean programming (90C09)
Related Items
LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison, Approximation algorithms for Steiner forest: An experimental study, Steiner tree packing revisited, A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem, Bounds for Random Binary Quadratic Programs, Global minimization of difference of quadratic and convex functions over box or binary constraints, Optimization methods for mixed integer weakly concave programming problems, A tight lower bound for a special case of quadratic 0-1 programming, Unified global optimality conditions for smooth minimization problems with mixed variables, Mathematical methods for physical layout of printed circuit boards: an overview, Global equilibrium search applied to the unconstrained binary quadratic optimization problem, An exact combinatorial algorithm for minimum graph bisection, The node capacitated graph partitioning problem: A computational study
Cites Work
