𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Bisection-Like Algorithm for Branch Switching at

✍ Scribed by J. Hughes; M. Friedman

Publisher
Springer US
Year
2009
Tongue
English
Weight
396 KB
Volume
41
Category
Article
ISSN
0885-7474

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A branch-and-price algorithm for switch-
A branch-and-price algorithm for switch-box routing
✍ David Grove JΓΈrgensen; Morten Meyling πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 206 KB πŸ‘ 1 views

## Abstract Routing in VLSI design concerns the wiring of a chip after the logical modules have been placed. A subproblem occurring in VLSI design is switch‐box routing. Switch‐box routing can be formulated as the problem of packing Steiner trees in a grid graph. The only previous exact solution me

A bisection algorithm for the numerical
A bisection algorithm for the numerical Mountain Pass
✍ Vivina Barutello, Susanna Terracinni πŸ“‚ Article πŸ“… 2007 πŸ› SP BirkhΓ€user Verlag Basel 🌐 English βš– 259 KB

We propose a constructive proof for the Ambrosetti-Rabinowitz Mountain Pass Theorem providing an algorithm, based on a bisection method, for its implementation. The efficiency of our algorithm, particularly suitable for problems in high dimensions, consists in the low number of flow lines to be comp

A new Lagrangian net algorithm for solvi
A new Lagrangian net algorithm for solving max-bisection problems
✍ Fengmin Xu; Xusheng Ma; Baili Chen πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 211 KB

The max-bisection problem is an NP-hard combinatorial optimization problem. In this paper, a new Lagrangian net algorithm is proposed to solve max-bisection problems. First, we relax the bisection constraints to the objective function by introducing the penalty function method. Second, a bisection s