Solving VLSI design and DNA sequencing problems using bipartization of graphs
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- L. Ingber & B. Rosen, 1992.
"Genetic algorithms and very fast simulated reannealing: A comparison,"
Lester Ingber Papers
92ga, Lester Ingber.
- L. Ingber & B. Rosen, 1993. "Genetic algorithms and very fast simulated reannealing: A comparison," Lester Ingber Papers 93ga, Lester Ingber.
- A. Custódio & H. Rocha & L. Vicente, 2010. "Incorporating minimum Frobenius norm models in direct search," Computational Optimization and Applications, Springer, vol. 46(2), pages 265-278, June.
More about this item
KeywordsElectronics; Genomics; Bipartite induced subgraph problem; Polyhedral approach; Branch-and-cut algorithm;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:51:y:2012:i:2:p:749-781. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .
We have no references for this item. You can help adding them by using this form .