Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Optim Lett

Search In Journal Title:

Abbravation: Optimization Letters

Search In Journal Abbravation:

Publisher

Springer Berlin Heidelberg

Search In Publisher:

DOI

10.1007/s00208-005-0706-7

Search In DOI:

ISSN

1862-4480

Search In ISSN:
Search In Title Of Papers:

An edgeswap heuristic for generating spanning tre

Authors: Ricardo M A Silva Diego M Silva Mauricio G C Resende Geraldo R Mateus José F Gonçalves Paola Festa
Publish Date: 2013/06/19
Volume: 8, Issue: 4, Pages: 1225-1243
PDF Link

Abstract

This paper presents a new edgeswap heuristic for generating spanning trees with a minimum number of branch vertices ie vertices of degree greater than two This problem was introduced in Gargano et al Lect Notes Comput Sci 2380355–365 2002 and has been called the minimum branch vertices problem by Cerulli et al Comput Optim Appl 42353–370 2009 The heuristic starts with a random spanning tree and iteratively reduces the number of branch vertices by swapping tree edges with edges not currently in the tree It can be easily implemented as a multistart heuristic We report on extensive computational experiments comparing singlestart and multistart variants on our heuristic with other heuristics previously proposed in the literatureThe research of RMA Silva was partially done while he was a postdoc scholar at ATT Labs Research in Florham Park New Jersey and was partially supported by the Brazilian National Council for Scientific and Technological Development CNPq the Foundation for Support of Research of the State of Minas Gerais Brazil FAPEMIG Coordination for the Improvement of Higher Education Personnel Brazil CAPES and Foundation for the Support of Development of the Federal University of Pernambuco Brazil FADE José F Gonçalves was supported by funds granted by the ERDF through the Programme COMPETE and by the Portuguese Government through FCT – Foundation for Science and Technology project PTDC/EGEGES/117692/2010 Diego M Silva was partially supported by CAPESMINTER Program between the Federal Universities of Minas Gerais and Lavras Brazil

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. An interior penalty method for a finite-dimensional linear complementarity problem in financial engineering
  2. The modified proximal point algorithm in CAT(0) spaces
  3. Selection of representative SNP sets for genome-wide association studies: a metaheuristic approach
  4. A semidefinite optimization approach to the Target Visitation Problem
  5. Elementary convex techniques for equilibrium, minimax and variational problems
  6. On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
  7. Symmetric duality for second-order fractional programs
  8. Generalized solutions of quasi variational inequalities
  9. A composite model in the context of a production-inventory system
  10. Preserving maximal monotonicity with applications in sum and composition rules
  11. Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
  12. Strong convergence of Mann’s type iteration method for an infinite family of generalized asymptotically nonexpansive nonself mappings in Hilbert spaces
  13. Stochastic subgradient descent method for large-scale robust chance-constrained support vector machines
  14. Polynomial-time identification of robust network flows under uncertain arc failures
  15. A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
  16. Maximizing strike aircraft planning efficiency for a given class of ground targets
  17. Dynamic lot-sizing problem with demand time windows and container-based transportation cost
  18. Sufficient conditions for protection routing in IP networks
  19. A note on diameters of point sets
  20. Capacity optimization through sensing threshold adaptation for cognitive radio networks
  21. Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function
  22. The perspective of a bank in granting credits: an optimization model
  23. k -Sum decomposition of strongly unimodular matrices
  24. Solving the weighted MAX-SAT problem using the dynamic convexized method
  25. Locating facilities in a competitive environment
  26. A comparison of several nearest neighbor classifier metrics using Tabu Search algorithm for the feature selection problem
  27. Global optimal approximate solutions
Search Result: