Francesco Maffioli
According to our database1,
Francesco Maffioli
authored at least 72 papers
between 1973 and 2014.
Collaborative distances:
Collaborative distances:
Timeline
1975
1980
1985
1990
1995
2000
2005
2010
0
1
2
3
4
5
6
7
8
9
1
2
1
3
1
3
5
1
6
3
1
1
4
3
2
2
2
3
3
2
1
1
3
1
1
1
1
1
1
1
1
1
1
2
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2014
2013
A branch-and-price approach to <i>k</i>-clustering minimum biclique completion problem.
Int. Trans. Oper. Res., 2013
On Binary Matroids Not Isomorphic To Their Base Matroids.
Ars Comb., 2013
2011
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011
2010
Computational experience with a SDP-based algorithm for maximum cut with limited unbalance.
Networks, 2010
Contributions Discret. Math., 2010
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010
2009
Math. Methods Oper. Res., 2009
2007
Theor. Comput. Sci., 2007
2006
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints.
Discret. Appl. Math., 2006
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006
2005
In: Alexander Schrijver, Editors, Combinatorial Optimization-Polyhedra and Efficiency or All You Wanted to Know about Polyhedral Combinatorics and Never Dared to Ask.
Eur. J. Oper. Res., 2005
2004
IEEE Trans. Wirel. Commun., 2004
Electron. Notes Discret. Math., 2004
Discret. Appl. Math., 2004
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004
Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs.
Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004
2003
Discret. Appl. Math., 2003
Discret. Appl. Math., 2003
2002
Proceedings of the IEEE International Conference on Communications, 2002
2001
Proceedings of the Applications of Evolutionary Computing, 2001
2000
J. Comb. Optim., 2000
Discret. Appl. Math., 2000
Ann. Oper. Res., 2000
1999
J. Complex., 1999
Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method.
J. Heuristics, 1999
1998
Comput. Oper. Res., 1998
Ann. Oper. Res., 1998
1997
Theor. Comput. Sci., 1997
Ann. Oper. Res., 1997
1996
Discret. Appl. Math., 1996
On the Logical Definability of Some Maximum Leaves Problems.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996
1994
Networks, 1994
Inf. Process. Lett., 1994
1993
Discret. Appl. Math., 1993
1992
Parallel Process. Lett., 1992
1991
1990
Modular Arithmetic and Randomization for Exact Matroid Problems.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990
1989
1986
Discret. Appl. Math., 1986
1984
Ann. Oper. Res., 1984
1983
Discret. Appl. Math., 1983
1982
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem.
Networks, 1982
1980
1979
1978
1975
Proceedings of the Optimization Techniques: Modeling and Optimization in the Service of Man, Part 2, 1975
1973
Proceedings of the 5th Conference on Optimization Techniques, 1973