Sousa, Teresa. "
Minimum Weight H-Decompositions of Graphs: The Bipartite Case."
Electronic Journal of Combinatorics. 18(1) (2011): P126, 10 pp.
AbstractGiven graphs G and H and a positive number b, a weighted (H,b)-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms an H-subgraph. We assign a weight of b to each H-subgraph in the decomposition and a weight of 1 to single edges. The total weight of the decomposition is the sum of the weights of all elements in the decomposition. Let f(n,H,b) be the the smallest number such that any graph G of order n admits an (H,b)-decomposition with weight at most f(n,H,b). The value of the function f(n,H,b) when b=1 was determined, for large n, by Pikhurko and Sousa [Pikhurko, O. and Sousa, T., Minimum H-Decompositions of Graphs, Journal of Combinatorial Theory, B, 97 (2007), 1041--1055.Here we determine the asymptotic value of f(n,H,b)for any fixed bipartite graph H and any value of b as n tends to infinity.
Baptista, Pedro V., Gonçalo Doria, Pedro Quaresma, Miguel Cavadas, Cristina S. Neves, Inês Gomes, Peter Eaton, Eulália Pereira, and Ricardo Franco. "
Nanoparticles in Molecular Diagnostics."
Progress in Molecular Biology and Translational Science: Nanoparticles in Translational Science and Medicine. Elsevier, 2011. 427-488.
Fradinho, Andre, Maria Isabel Gomes, and Ana Paula Barbosa-póvoa Optimization of Batteries Sustainable Distribution Network with Reverse Flows. Livro de actas do 15º congresso da APDIO, IO2011. Coimbra, Portugal, 2011.
AbstractOptimized supply chains, both economically as well as environmentally, are significant instruments to be adopted by companies if they want to succeed in the current competitive world. However, without the support of decision tools to help, at least approximately, the integration of these two aspects in the company’s decision making such aim is difficult to reach. The purpose of this study is to develop a mixed integer linear programming model (MILP), which allows the optimization of closed loop supply chains, considering not only economical aspects, but also environmental ones. The model developed was applied to a Portuguese company where their logistic network structure was redesigned.
Gomes, Isabel M., Luis J. Zeballos, Ana P. Barbosa-Povoa, and Augusto Q. Novais. "
Optimization of Closed-Loop Supply Chains under Uncertain Quality of Returns."
21st European Symposium on Computer Aided Process Engineering. Eds. E. Pistikopoulos, M. C. Georgiadis, and A. Kokossis. Vol. 29. 2011. 945-949.
AbstractThe efficient design and operation of supply chains with return flows represent a major optimization challenge, given the high number of factors involved and their intricate interactions. In particular, the quality level of the return products has strong economic and societal implications and depends greatly on the type of product (glass, paper, electronic, oil, etc) and on the degree of consumers’ readiness, frequently promoted by various kinds of awareness raising campaigns. A multi-product multi-period model was previously developed by the authors [1] for the closed-loop supply chain (CLSC) design and planning, where strategic and tactical decisions were comprehensively considered. This model is now being extended to handle the uncertainty related to the quality of the returned products, which at this stage is modeled by a two-stage scenario-based stochastic approach. General strategies to solve optimization problems involving uncertainty tend to exhibit poor computational performance, due to the problem NP-hard complexity, which tends to worsen with the problem size. Therefore and, in addition, a model performance solution enhancement is also being explored. To increase the efficiency of the solution approach, an alternative representation to some of the integer variables employed in the mathematical formulation was developed, which is tested by means of computational experiments being performed on illustrative real sized examples.