| G. Karypis. Multilevel Hypergraph Partitioning, chapter 3 of Multilevel Optimization and VLSICAD. Kluwer Academic Publishers, Boston, 2002. |
....solved in a predetermined sequence: we have one leader (associated with the upper level) who selects his decision rst and the follower (associated with the lower one) replies on this decision. If the constraints at both levels are all linear, we have a bilevel linear programming problem (BLP) In [1, 2, 11], one can nd both the essential fundamentals of multilevel optimization and its applications to the solution of real systems. Freiberg University of Mining and Technology, Freiberg, Germany; e mail: dempe math.tu freiberg.de, corresponding author Central Economics and Mathematics Institute ....
Multilevel Optimization: Algorithms and Applications, A. Migdalas, P. Pardalos, and P. Varbrand (Eds.), Kluwer Academic Publishers, Dordrecht et al., 1998.
No context found.
G. Karypis. Multilevel Hypergraph Partitioning, chapter 3 of Multilevel Optimization and VLSICAD. Kluwer Academic Publishers, Boston, 2002.
No context found.
G. Karypis. Multilevel Hypergraph Partitioning, chapter 3 of Multilevel Optimization and VLSICAD. Kluwer Academic Publishers, Boston, 2002.
No context found.
G. Karypis. Multilevel Hypergraph Partitioning, chapter 3 of Multilevel Optimization and VLSICAD. Kluwer Academic Publishers, Boston, 2002.
No context found.
G. Karypis. Multilevel Hypergraph Partitioning, chapter 3 of Multilevel Optimization and VLSICAD. Kluwer Academic Publishers, Boston, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC