Maria Teresa Almeida
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Maria Teresa Almeida has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Filipa Duarte de Carvalho
ISEG, Universidade de Lisboa, Lisbon, Portugal
9 shared publications - Gabriela Schütz
Universidade do Algarve
1 shared publication - Maria Cândida Mourão
ISEG/UL ‐ Lisbon School of Economics & Management Universidade de Lisboa Lisbon Portugal
1 shared publication - Mário Centeno
Banco de Portugal and Universidade Técnica de Lisboa
1 shared publication - Raul Brás
Universidade de Lisboa
1 shared publication
Latest Publications
- 1 November 2019
- Published by Elsevier in Computers & Operations Research
- Vol. 111, 258-270
The maximum l-triangle k-club problem: Complexity, properties, and algorithms
- 1 November 2019
- Published by Elsevier in Computers & Operations Research
- Vol. 111, 258-270
The maximum l-triangle k-club problem: Complexity, properties, and algorithms
- 29 March 2016
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 33 (3) , 814-846
The triangle k-club problem
- 29 March 2016
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 33 (3) , 814-846
The triangle k-club problem
- 1 December 2014
- Published by Elsevier in Computers & Operations Research
- Vol. 52, 94-104
Two-phase heuristics for the k-club problem
- 1 December 2014
- Published by Elsevier in Computers & Operations Research
- Vol. 52, 94-104
Two-phase heuristics for the k-club problem
- 12 August 2013
- Published by Elsevier in European Journal of Operational Research
- Vol. 232 (3) , 489-498
An analytical comparison of the LP relaxations of integer models for the k-club problem
- 12 August 2013
- Published by Elsevier in European Journal of Operational Research
- Vol. 232 (3) , 489-498
An analytical comparison of the LP relaxations of integer models for the k-club problem
Integer models and upper bounds for the 3‐club problem
Given an undirected graph, the k ‐club problem seeks a maximum cardinality subset of nodes that induces a subgraph with diameter at most k. We present two new formulations for the 3‐club problem: one is compact and the other has a nonpolynomial number of constraints. By defining an integer compact relaxation of the second formulation, we obtain a new upper bound on the 3‐club optimum that improves on the 3‐clique number bound. We derive new families of valid inequalities for the 3‐club polytope and use them to strengthen the LP relaxations of the new models. The computational study is performed on 120 graphs with up to 200 nodes and edge densities reported in the literature to produce difficult instances of the 3‐club problem. The results show that the new compact formulation is competitive with the exact solution methods reported in the literature, and that a large proportion of the LP gap is bridged with the new valid inequalities. © 2012 Wiley Periodicals, Inc. NETWORKS, 2012
Integer models and upper bounds for the 3‐club problem
Given an undirected graph, the k ‐club problem seeks a maximum cardinality subset of nodes that induces a subgraph with diameter at most k. We present two new formulations for the 3‐club problem: one is compact and the other has a nonpolynomial number of constraints. By defining an integer compact relaxation of the second formulation, we obtain a new upper bound on the 3‐club optimum that improves on the 3‐clique number bound. We derive new families of valid inequalities for the 3‐club polytope and use them to strengthen the LP relaxations of the new models. The computational study is performed on 120 graphs with up to 200 nodes and edge densities reported in the literature to produce difficult instances of the 3‐club problem. The results show that the new compact formulation is competitive with the exact solution methods reported in the literature, and that a large proportion of the LP gap is bridged with the new valid inequalities. © 2012 Wiley Periodicals, Inc. NETWORKS, 2012
- 1 May 2011
- Published by Elsevier in European Journal of Operational Research
- Vol. 210 (3) , 489-494
Upper bounds and heuristics for the 2-club problem
- 1 May 2011
- Published by Elsevier in European Journal of Operational Research
- Vol. 210 (3) , 489-494
Upper bounds and heuristics for the 2-club problem
- 31 May 2008
- Published by Elsevier in Computers & Operations Research
- Vol. 35 (5) , 1613-1623
Cell suppression problem: A genetic-based approach
- 31 May 2008
- Published by Elsevier in Computers & Operations Research
- Vol. 35 (5) , 1613-1623
Cell suppression problem: A genetic-based approach
- 1 April 2008
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 59 (4) , 556-562
A three-phase algorithm for the cell suppression problem in two-dimensional statistical tables
Journal of the Operational Research Society (JORS) is the world's longest established OR journal and an official journal of The OR Society. It is the aim of the Journal to present papers which are relevant to practitioners, researchers, teachers, students and consumers of operational research, and which cover the theory, practice, history or methodology of OR.
- 1 April 2008
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 59 (4) , 556-562
A three-phase algorithm for the cell suppression problem in two-dimensional statistical tables
Journal of the Operational Research Society (JORS) is the world's longest established OR journal and an official journal of The OR Society. It is the aim of the Journal to present papers which are relevant to practitioners, researchers, teachers, students and consumers of operational research, and which cover the theory, practice, history or methodology of OR.
- 30 November 2005
- Published by Elsevier in Computers & Operations Research
- Vol. 32 (11) , 2919-2936
Exact disclosure prevention in two-dimensional statistical tables
- 30 November 2005
- Published by Elsevier in Computers & Operations Research
- Vol. 32 (11) , 2919-2936
Exact disclosure prevention in two-dimensional statistical tables
- 1 May 2000
- Published by Elsevier in European Journal of Operational Research
- Vol. 123 (1) , 29-41
Lower-bounding procedures for the 2-dimensional cell suppression problem
- 1 May 2000
- Published by Elsevier in European Journal of Operational Research
- Vol. 123 (1) , 29-41
Lower-bounding procedures for the 2-dimensional cell suppression problem