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/s10474-007-6041-6

Search In DOI:

ISSN

1862-4480

Search In ISSN:
Search In Title Of Papers:

Emphasis Type="Italic"k/EmphasisSum decomposi

Authors: K Papalamprou L Pitsoulis
Publish Date: 2015/11/30
Volume: 11, Issue: 2, Pages: 407-418
PDF Link

Abstract

Networks are frequently studied algebraically through matrices In this work we show that networks may be studied in a more abstract level using results from the theory of matroids by establishing connections to networks by decomposition results of matroids First we present the implications of the decomposition of regular matroids to networks and related classes of matrices and secondly we show that strongly unimodular matrices are closed under ksums for k=12 implying a decomposition into highly connected networkrepresenting blocks which are also shown to have a special structure

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. An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
  4. Selection of representative SNP sets for genome-wide association studies: a metaheuristic approach
  5. A semidefinite optimization approach to the Target Visitation Problem
  6. Elementary convex techniques for equilibrium, minimax and variational problems
  7. On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
  8. Symmetric duality for second-order fractional programs
  9. Generalized solutions of quasi variational inequalities
  10. A composite model in the context of a production-inventory system
  11. Preserving maximal monotonicity with applications in sum and composition rules
  12. Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
  13. Strong convergence of Mann’s type iteration method for an infinite family of generalized asymptotically nonexpansive nonself mappings in Hilbert spaces
  14. Stochastic subgradient descent method for large-scale robust chance-constrained support vector machines
  15. Polynomial-time identification of robust network flows under uncertain arc failures
  16. A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
  17. Maximizing strike aircraft planning efficiency for a given class of ground targets
  18. Dynamic lot-sizing problem with demand time windows and container-based transportation cost
  19. Sufficient conditions for protection routing in IP networks
  20. A note on diameters of point sets
  21. Capacity optimization through sensing threshold adaptation for cognitive radio networks
  22. Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function
  23. The perspective of a bank in granting credits: an optimization model
  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: