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-Verlag

Search In Publisher:

DOI

10.1007/bf02168074

Search In DOI:

ISSN

1862-4480

Search In ISSN:
Search In Title Of Papers:

Polynomialtime identification of robust network f

Authors: Vladimir L Boginski Clayton W Commander Timofey Turko
Publish Date: 2009/05/23
Volume: 3, Issue: 3, Pages: 461-473
PDF Link

Abstract

We propose Linear Programming LPbased solution methods for network flow problems subject to multiple uncertain arc failures which allow finding robust optimal solutions in polynomial time under certain conditions We justify this fact by proving that for the considered class of problems under uncertainty with linear loss functions the number of entities in the corresponding LP formulations is polynomial with respect to the number of arcs in the network The proposed formulation is efficient for sparse networks as well as for timecritical networked systems where quick and robust decisions play a crucial role

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. 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: