Francesco Maffioli

Eur. J. Oper. Res., 2005

2004

A tree partitioning dynamic policy for OVSF codes assignment in wideband CDMA.

[BibT_eX]

[DOI]

Maria Luisa Merani

IEEE Trans. Wirel. Commun., 2004

A particular class of graphic matroids.

[BibT_eX]

[DOI]

Norma Zagaglia Salvi

Electron. Notes Discret. Math., 2004

Preface.

[BibT_eX]

[DOI]

Leo Liberti

Electron. Notes Discret. Math., 2004

Algorithms for finding minimum fundamental cycle bases in graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

On the complexity of graph tree partition problems.

[BibT_eX]

[DOI]

Roberto Cordone

Discret. Appl. Math., 2004

Cardinality constrained minimum cut problems: complexity and algorithms.

[BibT_eX]

[DOI]

Maurizio Bruglieri

Matthias Ehrgott

Discret. Appl. Math., 2004

Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases.

[BibT_eX]

[DOI]

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs.

[BibT_eX]

Edoardo Amaldi

Leo Liberti

Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

2003

On Some Properties of Base-matroids.

[BibT_eX]

[DOI]

Norma Zagaglia Salvi

Electron. Notes Discret. Math., 2003

The Base-matroid and Inverse Combinatorial Optimization Problems.

[BibT_eX]

[DOI]

Federico Malucelli

Discret. Appl. Math., 2003

Discrete facility location and routing of obnoxious activities.

[BibT_eX]

[DOI]

Paola Cappanera

Giorgio Gallo

Discret. Appl. Math., 2003

The vehicle routing problem: A book review.

[BibT_eX]

[DOI]

4OR, 2003

2002

Book Reviews.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2002

Efficient algorithms for the assignment of OVSF codes in wideband CDMA.

[BibT_eX]

[DOI]

Maria Luisa Merani

Proceedings of the IEEE International Conference on Communications, 2002

2001

Fishman's sampling plan for computing network reliability.

[BibT_eX]

[DOI]

IEEE Trans. Reliab., 2001

Coloured Ant System and Local Search to Design Local Telecommunication Networks.

[BibT_eX]

[DOI]

Roberto Cordone

Proceedings of the Applications of Evolutionary Computing, 2001

2000

Combining Linear and Non-Linear Objectives in Spanning Tree Problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2000

Solving the Two-Connected Network with Bounded Meshes Problem.

[BibT_eX]

[DOI]

Bernard Fortz

Martine Labbé

Oper. Res., 2000

Solving the feedback vertex set problem on undirected graphs.

[BibT_eX]

[DOI]

Lorenzo Brunetta

Marco Trubian

Discret. Appl. Math., 2000

Approximability of hard combinatorial optimization problems: an introduction.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2000

1999

Exact solution of the SONET Ring Loading Problem.

[BibT_eX]

[DOI]

Martine Labbé

Oper. Res. Lett., 1999

Randomized Algorithms over Finite Fields for the Exact Parity Base Problem.

[BibT_eX]

[DOI]

Carlo Viola

J. Complex., 1999

Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method.

[BibT_eX]

[DOI]

Andrea Lodi

J. Heuristics, 1999

1998

New bounds for optimum traffic assignment in satellite communication.

[BibT_eX]

[DOI]

Marco Trubian

Comput. Oper. Res., 1998

A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem.

[BibT_eX]

[DOI]

Anna Sciomachen

Ann. Oper. Res., 1998

1997

On the Approximability of Some Maximum Spanning Tree Problems.

[BibT_eX]

[DOI]

Angelo Morzenti

Theor. Comput. Sci., 1997

A mixed-integer model for solving ordering problems with side constraints.

[BibT_eX]

[DOI]

Anna Sciomachen

Ann. Oper. Res., 1997

1996

Complexity of spanning tree problems with leaf-dependent objectives.

[BibT_eX]

[DOI]

Martine Labbé

Networks, 1996

on Some Multicriteria Arborescence Problems: Complexity and Algorithms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

On the Logical Definability of Some Maximum Leaves Problems.

[BibT_eX]

Angelo Morzenti

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1994

Weighted k-cardinality trees: Complexity and polyhedral structure.

[BibT_eX]

[DOI]

Networks, 1994

A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem.

[BibT_eX]

[DOI]

Angelo Morzenti

Inf. Process. Lett., 1994

on the Computation of Pfaffians.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

1993

In Memoriam Paolo M. Camerini.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

Preface.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

Note on Combinatorial Optimization with Max-Linear Objective Functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

1992

Constructing an Exact Parity Base Is in RNC2.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1992

Random Pseudo-Polynomial Algorithms for Exact Matroid Problems.

[BibT_eX]

[DOI]

J. Algorithms, 1992

1991

The image of weighted combinatorial problems.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1991

1990

Modular Arithmetic and Randomization for Exact Matroid Problems.

[BibT_eX]

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1989

Multi-constrained matroidal knapsack problems.

[BibT_eX]

[DOI]

Carlo Vercellis

Math. Program., 1989

1986

Randomized algorithms in combinatorial optimization: A survey.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1986

Preface.

[BibT_eX]

[DOI]

Giorgio Gallo

Discret. Appl. Math., 1986

Most and least uniform spanning trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1986

1984

Randomized algorithms: An annotated bibliography - In alphabetical order.

[BibT_eX]

[DOI]

M. Grazia Speranza

Carlo Vercellis

Ann. Oper. Res., 1984

1983

On the complexity of finding multi-constrained spanning trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1983

1982

On the worst-case performance of some algorithms for the asymmetric traveling salesman problem.

[BibT_eX]

[DOI]

Alan M. Frieze

Networks, 1982

1980

The k best spanning arborescences of a network.

[BibT_eX]

[DOI]

Luigi Fratta

Networks, 1980

1979

A note on finding optimum branchings.

[BibT_eX]

[DOI]

Luigi Fratta

Networks, 1979

1978

Heuristically guided algorithm for k-parity matroid problems.

[BibT_eX]

[DOI]

Discret. Math., 1978

1975

Bounds for 3-Matroid Intersection Problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1975

Subgradient Optimization, Matroid Problems and Heuristic Evaluation.

[BibT_eX]

[DOI]

Proceedings of the Optimization Techniques: Modeling and Optimization in the Service of Man, Part 2, 1975

1973

On Constrained Diameter and Medium Optimal Spanning Trees.

[BibT_eX]

[DOI]