MAFFIOLI, FRANCESCO

MAFFIOLI, FRANCESCO  

DIPARTIMENTO DI ELETTRONICA, INFORMAZIONE E BIOINGEGNERIA  

Mostra records
Risultati 1 - 20 di 68 (tempo di esecuzione: 0.025 secondi).
Titolo Data di pubblicazione Autori File
A branch-and-cut method for the obnoxious p-median problem 1-gen-2007 P. BelottiMAFFIOLI, FRANCESCO +
A Branch-and-Price Approach to the k-Clustering Minimum Biclique Completion Problem 1-gen-2010 GUALANDI, STEFANOMAFFIOLI, FRANCESCOMAGNI, CAMILLO
A characterization of the base-matroids of a graphic matroid 1-gen-2010 MAFFIOLI, FRANCESCOZAGAGLIA, NORMA
A Lagrangian Heuristic for the Prize Collecting TSP 1-gen-1998 MAFFIOLI, FRANCESCO +
A Mixed-integer Model for Solving Ordering problems with Side Constraints 1-gen-1997 MAFFIOLI, FRANCESCO +
A particular class of graphic matroids 1-gen-2004 MAFFIOLI, FRANCESCOZAGAGLIA, NORMA
A Tree Partitioning Dynamic Policy for OVSF Codes Assignment in CDMA 1-gen-2004 MAFFIOLI, FRANCESCO +
Algorithms for finding minimum fundamental cycle bases in graphs 1-gen-2004 AMALDI, EDOARDOLIBERTI, LEO SERGIOMAFFIOLI, FRANCESCO +
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints 1-gen-2006 BRUGLIERI, MAURIZIOMAFFIOLI, FRANCESCO +
Approximability of hard combiantorial optimization problems: an introduction 1-gen-2000 MAFFIOLI, FRANCESCO +
Approximating max cut with limited unbalence 1-gen-2006 MAFFIOLI, FRANCESCO +
Approximating Maximum Cut with Limited Unbalance 1-gen-2007 MAFFIOLI, FRANCESCO +
Approximation algorithms for maximum cut with limited unbalance 1-gen-2007 MAFFIOLI, FRANCESCO +
Cardinality constrained minimum cut problems: complexity and algorithms 1-gen-2004 BRUGLIERI, MAURIZIOMAFFIOLI, FRANCESCO +
Coloured ant system and local search to design local telecommunication networks 1-gen-2001 MAFFIOLI, FRANCESCO +
Coloured Ant System and Local Search to Design Local Telecommunication Networks 1-gen-2001 MAFFIOLI, FRANCESCO +
Combinatorial Optimization-Polyhedra and Efficiency or All You Wanted to Know about Polyhedral Combinatorics and Never Dared to Ask 1-gen-2005 MAFFIOLI, FRANCESCO
Combining Linear and Non-Linear Objectives in Spanning Tree Problems 1-gen-2000 MAFFIOLI, FRANCESCO +
Computational Experience with a SDP-Based Algorithm for Maximum Cut with Limited Unbalance 1-gen-2010 GUALANDI, STEFANOMAFFIOLI, FRANCESCO +
Computational experience with a SDP-based algorithm for maximum cut with limited unbalance 1-gen-2007 GUALANDI, STEFANOMAFFIOLI, FRANCESCO +