Author:
Bruglieri Maurizio,Maffioli Francesco,Ehrgott Matthias
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference32 articles.
1. A.A. Ageev, M.I. Sviridenko, Approximation algorithms for maximum coverage and max-cut with given sizes of parts, in: Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, Vol. 1610, Springer, Berlin, 1999, pp. 17–30.
2. On some applications of the Chinese postman problem, in: Algorithms and Combinatorics: Paths, Flows, and VLSI-Layout;Barahona,1990
3. An application of combinatorial optimization to statistical physics and circuit layout design;Barahona;Oper. Res.,1988
4. B. Borchers, CSDP, a C library for semidefinite programming, Optimization Methods and Software 11 (1999) 613–623, http://www.nmt.edu/~borchers/csdp.html.
5. M. Bruglieri, K-Cardinality cut problems, Ph.D. Thesis, Dottorato MA.C.R.O., Department of Mathematics ‘F. Enriquez’, University of Milan, 2000. Available at www.elet.polimi.it/upload/bruglier/kcut/PhD-thesis.zip.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献