Pages that link to "Item:Q1327559"
From MaRDI portal
The following pages link to Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits (Q1327559):
Displaying 13 items.
- Optimization methods for mixed integer weakly concave programming problems (Q489113) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- Global minimization of difference of quadratic and convex functions over box or binary constraints (Q928298) (← links)
- Mathematical methods for physical layout of printed circuit boards: an overview (Q991814) (← links)
- The node capacitated graph partitioning problem: A computational study (Q1290618) (← links)
- Steiner tree packing revisited (Q1935940) (← links)
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866) (← links)
- A tight lower bound for a special case of quadratic 0-1 programming (Q2492664) (← links)
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem (Q3503843) (← links)
- Unified global optimality conditions for smooth minimization problems with mixed variables (Q3598042) (← links)
- Bounds for Random Binary Quadratic Programs (Q4609468) (← links)
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem (Q5459821) (← links)
- Approximation algorithms for Steiner forest: An experimental study (Q6065858) (← links)