Martin Grötschel, A. Martin, Robert Weismantel  Home/Search
Context Related
| zib.de/pub/zibpublicatio...SC9209.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: zib.de/martin/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we describe a cutting plane algorithm for the Steiner tree packing problem. We use our algorithm to solve some switchbox routing problems of VLSI-design and report on our computational experience. This includes a brief discussion of separation algorithms, a new LP-based primal heuristic and implementation details. The paper is based on the polyhedral theory for the Steiner tree packing polyhedron developed in our companion paper [GMW92] and meant to turn this theory into an... (Update)
Context of citations to this paper: More
...some monetary value. This problem has already attracted some attention in the integer programming community (see [6] 7] 10] 12] and [11]) Here we present an integer programming formulation that uses Steiner cut inequalities We note that there are several good heuristic...
.... were integrated into a branch and cut framework and succesfully applied to solve switchbox routing problems discussed in the literature (see [5, 7]) So far we just focused on the two (extreme) cases where c = 1I or c = 1. In order to give an impression what may happen if the...
Cited by: More
Packing Steiner trees - Jain, Mahdian, Salavatipour (2003) (Correct)
Capacitated Network Design with Multicast Commodities - BIENSTOCK, Bley (2000) (Correct)
Hybrid Column Generation Approaches for Solving Real World Crew .. - Yunes, al. (2000) (Correct)
Similar documents (at the sentence level):
6.9%: Packing Steiner Trees: Polyhedral Investigations - Grötschel, Martin, Weismantel (1992) (Correct)
6.7%: The Steiner Tree Packing Problem in VLSI-Design - Grötschel, Martin, Weismantel (1997) (Correct)
Active bibliography (related documents): More All
3.6: Packing Steiner Trees: Separation Algorithms - Grötschel, Martin, Weismantel (1993) (Correct)
1.9: Packing Paths and Steiner Trees: Routing of Electronic Circuits - Martin, Weismantel (1993) (Correct)
0.5: Packing Steiner Trees: Further Facets - Grötschel, Martin, Weismantel (1993) (Correct)
Similar documents based on text: More All
0.7: Gasbor: A Genetic Algorithm Approach For Solving The.. - Lienig, Thulasiraman (1996) (Correct)
0.3: A Parallel Genetic Algorithm for Performance-Driven VLSI Routing - Lienig (1997) (Correct)
0.3: Channel and Switchbox Routing with Minimized Crosstalk - A.. - Lienig (1997) (Correct)
Related documents from co-citation: More All
3: The Steiner tree problem I: Formulations (context) - Chopra, Rao
2: Reliable concurrent multicast from bursty sources - Ofek, Yener - 1996
2: The Steiner tree problem II: properties and classes of facets (context) - Chopra, Rao
BibTeX entry: (Update)
M. Grotchel, A. Martin, and R. Weismantel. Packing steiner trees: a cutting plane algorithm and computation. Mathematical Programming, 72:125--145, 1996. http://citeseer.ist.psu.edu/grotchel92packing.html More
@misc{ grotchel96packing,
author = "M. Grotchel and A. Martin and R. Weismantel",
title = "Packing steiner trees: a cutting plane algorithm and computation",
text = "M. Grotchel, A. Martin, and R. Weismantel. Packing steiner trees: a cutting
plane algorithm and computation. Mathematical Programming, 72:125--145,
1996.",
year = "1996",
url = "citeseer.ist.psu.edu/grotchel92packing.html" }
Citations (may not include all citations):24 Technische Universitat Berlin (context) - Martin, von Steinerbaumen et al. - 1992
8 Advances in Computing Research (context) - Kramer, van Leeuwen et al. - 1984
7 Weismantel: Packing Steiner trees: polyhedral investigations (context) - Grotschel, Martin - 1992
5 IEEE Transactions on Computer-Aided-Design CAD (context) - Sarrafzadeh, in et al. - 1987
5 Johnson: The rectilinear Steiner tree problem is NP-complete (context) - Garey - 1977
4 Monma: Integer polyhedra associated with certain network des.. (context) - Grotschel - 1990
4 IEEE Transactions on Computer-Aided-Design CAD (context) - Burstein, Pelavin et al. - 1983
3 Brown: VLSI routing: Four layers suffice (context) - Brady - 1984
3 Heck: BEAVER: A computational-geometry-based tool for switch.. (context) - Cohoon - 1988
3 Mathematical Programming (context) - Fischetti, two et al. - 1991
3 Wagner: The Steiner problem in graphs (context) - Dreyfus - 1971
3 Weismantel: Packing Steiner trees: separation algorithms (context) - Grotschel, Martin - 1993
3 Advances in Computing Research (context) - Lipski, structure et al. - 1984
2 Veinott: Send-and-split method for minimum concave-cost netw.. (context) - Erickson, Monma - 1987
2 Rao: The Steiner tree problem II: Properties and classes of .. (context) - Chopra - 1988
2 Stoer: Computational results with a cutting plane algorithm .. (context) - Grotschel, Monma - 1992
2 Rao: The Steiner tree problem I: Formulations (context) - Chopra - 1988
1 Rinaldi: A branch and cut algorithm for the resolution of la.. (context) - Padberg - 1991
1 Wolfe: Decomposition principle for linear programs (context) - Dantzig - 1960
1 Pulleyblank: Two terminal Steiner tree polyhedra (context) - Ball, Liu - 1987
1 Holland: Solution of large-scale symmetric travelling salesm.. (context) - Grotschel - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.zib.de/martin/publications.html): More
Packing Paths and Steiner Trees: Routing of Electronic Circuits - Martin, Weismantel (1993) (Correct)
Optimum Path Packing on Wheels: The Consecutive Case - Grötschel, Martin, Weismantel (1995) (Correct)
The Intersection of Knapsack Polyhedra and Extensions - Martin, Weismantel (1998) (Correct)
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