Bruno Simeone

发表

A Satisfiability Formulation of Problems on Level Graphs

Endre Boros, Kazuhisa Makino, Peter L. Hammer, 2001, Electron. Notes Discret. Math..

Theoretical results on at most 1-bend embeddability of graphs

Rossella Petreschi, Bruno Simeone, Yanpei Liu, 1992 .

A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders

Ronald I. Becker, Isabella Lari, Bruno Simeone, 2001, Theory of Computing Systems.

An Automatic River Planning Operating System (ARPOS)

Tommaso Toffoli, Bruno Simeone, Enrico Martino, 1973, Optimization Techniques.

Max-min partitioning of grid graphs into connected components

Ronald I. Becker, Isabella Lari, Bruno Simeone, 1998, Networks.

Block linear majorants in quadratic 0-1 optimization

Endre Boros, Isabella Lari, Bruno Simeone, 2004, Discret. Appl. Math..

On a 2-dimensional equipartition problem

Federico Malucelli, Bruno Simeone, Francesco Conti, 1999, Eur. J. Oper. Res..

Maximum Split Clustering Under Connectivity Constraints

Pierre Hansen, Brigitte Jaumard, Bruno Simeone, 1993, J. Classif..

Evaluation and Optimisation of Electoral Systems

Bruno Simeone, Steve Abbott, Federica Ricca, 2000 .

A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional Grid

Yanpei Liu, Bruno Simeone, Aurora Morgana, 1998, Discret. Appl. Math..

The give-up problem for blocked regional lists with multi-winners

Andrea Scozzari, Bruno Simeone, Federica Ricca, 2011, Math. Soc. Sci..

On-line 2-satisfiability

Brigitte Jaumard, Rossella Petreschi, Bruno Simeone, 2005, Annals of Mathematics and Artificial Intelligence.

Political Districting: from classical models to recent approaches

Andrea Scozzari, Bruno Simeone, Federica Ricca, 2013, Annals of Operations Research.

Fortran codes for network optimization

Bruno Simeone, 1988 .

On the Complexity of the Maximum Satisfiability Problem for Horn Formulas

Brigitte Jaumard, Bruno Simeone, 1987, Inf. Process. Lett..

2. A Unified Description of Electoral Systems

Bruno Simeone, Federica Ricca, Pietro Grilli di Cortona, 1999 .

Peter Ladislaw Hammer: December 23, 1936–December 27, 2006

Endre Boros, Yves Crama, Bruno Simeone, 2007, J. Heuristics.

A shifting algorithm for continuous tree partitioning

Ronald I. Becker, Bruno Simeone, Yen-I Chiang, 2002, Theor. Comput. Sci..

Clustering heuristics for set covering

Bruno Simeone, Renata Krystyna Kwatera, B. Simeone, 1993, Ann. Oper. Res..

Report of the Session on

Bruno Simeone, Michel Gondran, 1979 .

Local search algorithms for political districting

Bruno Simeone, Federica Ricca, B. Simeone, 2008, Eur. J. Oper. Res..

Bicolored graph partitioning, or: gerrymandering at its worst

Ronald I. Becker, Isabella Lari, Bruno Simeone, 2009, Discret. Appl. Math..

Degree sequences of matrogenic graphs

Rossella Petreschi, Bruno Simeone, Aurora Morgana, 1984, Discret. Math..

A Boolean theory of signatures for tonal scales

Isabella Lari, Bruno Simeone, M. Mezzadri, 2014, Discret. Appl. Math..

Peter Ladislaw Hammer

Endre Boros, Yves Crama, Bruno Simeone, 2007, Discret. Math..

Certificates of optimality: the third way to biproportional apportionment

Bruno Simeone, Paolo Serafini, 2012, Soc. Choice Welf..

Saturated systems of homogeneous boxes and the logical analysis of numerical data

Peter L. Hammer, Yanpei Liu, Sándor Szedmák, 2004, Discret. Appl. Math..

Consensus algorithms for the generation of all maximal bicliques

Peter L. Hammer, Gabriela Alexe, Sorin Alexe, 2004, Discret. Appl. Math..

A Sunday Opening Calendar for Shops in Rome through Random Utility Matching and Travelling Salesman Models

Bruno Simeone, Alfredo Fiocco, Domenico Tersigni, 1998 .

A selected artificial intelligence bibliography for operations researchers

Brigitte Jaumard, Bruno Simeone, Peng Si OW, 1988 .

Weighted Voronoi region algorithms for political districting

Andrea Scozzari, Bruno Simeone, Federica Ricca, 2008, Math. Comput. Model..

Path equipartition in the Chebyshev norm

Bruno Simeone, Aurora Morgana, Giovanni Storchi, 2000, Eur. J. Oper. Res..

Polynomial algorithms for nested univariate clustering

Pierre Hansen, Brigitte Jaumard, Bruno Simeone, 1996, Discret. Math..

Most Uniform Path Partitioning and its Use in Image Processing

Yehoshua Perl, Bruno Simeone, Mario Lucertini, 1993, Discret. Appl. Math..

Box-threshold graphs

Bruno Simeone, Uri N. Peled, B. Simeone, 1984, J. Graph Theory.

Peter Ladislaw Hammer: December 23, 1936 to December 27, 2006

Endre Boros, Yves Crama, Bruno Simeone, 2007, Discret. Appl. Math..

Obituary Peter L. Hammer (1936-2006)

Endre Boros, Yves Crama, Bruno Simeone, 2007, Bull. EATCS.

Roof duality, complementation and persistency in quadratic 0–1 optimization

Pierre Hansen, Peter L. Hammer, Bruno Simeone, 1984, Math. Program..

On the supermodular knapsack problem

Giorgio Gallo, Bruno Simeone, 1989, Math. Program..

Cardinality constrained path covering problems in grid graphs

Lou Caccetta, Bruno Simeone, Nicola Apollonio, 2004, Networks.

Network flow methods for electoral systems

Andrea Scozzari, Bruno Simeone, Paolo Serafini, 2012, Networks.

On the complexity of general matrix scaling and entropy minimization via the RAS algorithm

Bahman Kalantari, Isabella Lari, Bruno Simeone, 2007, Math. Program..

Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem

Peter L. Hammer, Bruno Simeone, Perino M. Dearing, 1987, Transp. Sci..

The maximum vertex coverage problem on bipartite graphs

Bruno Simeone, Nicola Apollonio, B. Simeone, 2014, Discret. Appl. Math..

Fair dissections of spiders, worms, and caterpillars

Caterina De Simone, Bruno Simeone, Stefano Pallottino, 1990, Networks.

Peter Ladislaw Hammer: December 23, 1936-December 27, 2006

Endre Boros, Yves Crama, Bruno Simeone, 2007, Discret. Optim..

Adamant digraphs

Rossella Petreschi, Bruno Simeone, Aurora Morgana, 1988, Discret. Math..

Polynomial-time algorithms for regular set-covering and threshold synthesis

Bruno Simeone, Uri N. Peled, B. Simeone, 1985, Discret. Appl. Math..

Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment

Bruno Simeone, Paolo Serafini, B. Simeone, 2012, Networks.

Lectures given at the third session of the Centro Internazionale Matematico Estivo (C.I.M.E.) on Combinatorial optimization

Bruno Simeone, 1989 .

Consensus of Hierarchical Classifications

Maurizio Vichi, Bruno Simeone, B. Simeone, 1998 .

The splittance of a graph

Peter L. Hammer, Bruno Simeone, P. Hammer, 1981, Comb..

Image enhancement by path partitioning

Yehoshua Perl, Bruno Simeone, Mario Lucertini, 1989, Recent Issues in Pattern Analysis and Recognition.

Unimodular functions

Pierre Hansen, Bruno Simeone, P. Hansen, 1986, Discrete Applied Mathematics.

Carpal Tunnel Syndrome automatic classification: electromyography vs. ultrasound imaging

Bruno Simeone, Federica Ricca, Vincenzo Spinelli, 2015 .

Political districting: from classical models to recent approaches

Andrea Scozzari, Bruno Simeone, Federica Ricca, 2011, 4OR.

A Switching Algorithm for the Solution of Quadratic Boolean Equations

Rossella Petreschi, Bruno Simeone, 1980, Inf. Process. Lett..

The Sunfish Against the Octopus: Opposing Compactness to Gerrymandering

Ronald I. Becker, Isabella Lari, Bruno Simeone, 2006 .

Computing sharp bounds for hard clustering problems on trees

Isabella Lari, Bruno Simeone, Maurizio Maravalle, 2009, Discret. Appl. Math..

Combinatorial problems related to origin-destination matrices

Endre Boros, Peter L. Hammer, Bruno Simeone, 2001, Discret. Appl. Math..

From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions

Peter L. Hammer, Dominique de Werra, Thomas M. Liebling, 1988, SIAM J. Discret. Math..

An asymptotically exact polynomial algorithm for equipartition problems

Bruno Simeone, B. Simeone, 1986, Discret. Appl. Math..

The Maximum Box Problem and its Application to Data Analysis

Ying Liu, Peter L. Hammer, Bruno Simeone, 2002, Comput. Optim. Appl..

Improved Approximation of Maximum Vertex Coverage Problem on Bipartite Graphs

Bruno Simeone, Nicola Apollonio, B. Simeone, 2014, SIAM J. Discret. Math..

A O(nm)-Time Algorithm for Computing the Dual of a Regular Boolean Function

Bruno Simeone, Uri N. Peled, 1994, Discret. Appl. Math..

12. Optimization Models for Electoral Districting

Bruno Simeone, Federica Ricca, Pietro Grilli di Cortona, 1999 .

A linear programming based heuristic for a hard clustering problem on trees

Isabella Lari, Bruno Simeone, Maurizio Maravalle, 1998 .

Pareto-optimal patterns in logical analysis of data

Peter L. Hammer, Alexander Kogan, Sándor Szedmák, 2004, Discret. Appl. Math..

Recognition of a class of unimodular functions

Dominique de Werra, Bruno Simeone, Maurice Cochand, 1990, Discret. Appl. Math..

Boolean-Combinatorial Bounding of Maximum 2-Satisfiability

Peter L. Hammer, William R. Pulleyblank, Bruno Simeone, 1992, Computer Science and Operations Research.

Drawing Political Districts by Weighted Voronoi Regions and Local Search

Andrea Scozzari, Isabella Lari, Bruno Simeone, 2006 .

A pseudo-Boolean consensus approach to nonlinear 0-1 optimization

Bruno Simeone, B. Simeone, 2008, Discret. Appl. Math..

Classification Techniques and Error Control in Logic Mining

Giovanni Felici, Bruno Simeone, Vincenzo Spinelli, 2010, Data Mining.

Maximum weight archipelago subgraph problem

Peter L. Hammer, Béla Vizvári, Bruno Simeone, 2014, Ann. Oper. Res..

Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs

Justo Puerto, Isabella Lari, Bruno Simeone, 2008, Networks.

Mathematics and Democracy

Bruno Simeone, Friedrich Pukelsheim, F. Pukelsheim, 2006 .

Sharp bounds for the maximum of the chi-square index in a class of contingency tables with given marginals

Alfredo Rizzi, Bahman Kalantari, Isabella Lari, 1993 .

Error minimization methods in biproportional apportionment

Andrea Scozzari, Bruno Simeone, Paolo Serafini, 2012 .

Path Composition and Multiple Choice in a Bimodal Transportation Network. Volume 2: Modelling Transport Systems

Mario Lucertini, Bruno Simeone, Maria Gloria Battista, 1996 .

Max-min partitioning of grid graphs into connected components

Ronald I. Becker, Mario Lucertini, Isabella Lari, 1998 .

Product form parametric representation of the solutions to a quadratic boolean equation

Brigitte Jaumard, Peter L. Hammer, Yves Crama, 1987 .

A spanning tree heuristic for regional clustering

Bruno Simeone, Maurizio Maravalle, B. Simeone, 1995 .

ON THE GENERAL THEORETICAL RESULTS FOR RECTILINEAR EMBEDDABILITY OF GRAPHS

Bruno Simeone, 刘彦佩, A.Morgana, 1991 .

Evaluation and Optimization of Electoral Systems

Bruno Simeone, Federica Ricca, Cecilia Manzi, 1987 .

Amending and Enhancing Electoral Laws Through Mixed Integer Programming: the Case of Italy

Bruno Simeone, Paolo Serafini, Federica Ricca, 2007 .

Optimal grouping of researchs into departments

Bruno Simeone, G. Gallo, B. Simeone, 1991 .

Experimental comparison of 2-satisfiability algorithms

Rossella Petreschi, Bruno Simeone, B. Simeone, 1991 .

Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs

Justo Puerto, Isabella Lari, Bruno Simeone, 2008 .

Node-weighted graphs having the König-Egerváry property

Peter L. Hammer, Bruno Simeone, P. Hammer, 1984 .

Closed Sets and Generators in Ternary Hamming Spaces

Endre Boros, Peter L. Hammer, Bruno Simeone, 1998 .

Consistency of Quadratic Boolean Equations and the König-Egerváry Property for Graphs

Bruno Simeone, 1985 .

ON THE ITERATIVE PROPORTIONAL FITTING PROCEDURE : STRUCTURE OF ACCUMULATION POINTS AND L 1-ERROR ANALYSIS

Bruno Simeone, Friedrich Pukelsheim, F. Pukelsheim, 2009 .