Browsing by Subject "Problem parameters"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    Optimal representation of non-stationary random fields with finite numbers of samples: A linear MMSE framework
    (Elsevier, 2013) Özçelikkale, A.; Özaktaş, Haldun M.
    In this article we consider the representation of a finite-energy non-stationary random field with a finite number of samples. We pose the problem as an optimal sampling problem where we seek the optimal sampling interval under the mean-square error criterion, for a given number of samples. We investigate the optimum sampling rates and the resulting trade-offs between the number of samples and the representation error. In our numerical experiments, we consider a parametric non-stationary field model, the Gaussian-Schell model, and present sampling schemes for varying noise levels and for sources with varying numbers of degrees of freedom. We discuss the dependence of the optimum sampling interval on the problem parameters. We also study the sensitivity of the error to the chosen sampling interval.
  • Thumbnail Image
    ItemOpen Access
    Time constrained maximal covering salesman problem with weighted demands and partial coverage
    (Elsevier Ltd, 2016) Ozbaygin, G.; Yaman, H.; Karasan, O. E.
    In a routing framework, it may not be viable to visit every single customer separately due to resource limitations or efficiency concerns. In such cases, utilizing the notion of coverage; i.e., satisfying the demand of multiple customers by visiting a single customer location, may be advantageous. With this motivation, we study the time constrained maximal covering salesman problem (TCMCSP) in which the aim is to find a tour visiting a subset of customers so that the amount of demand covered within a limited time is maximized. We provide flow and cut formulations and derive valid inequalities. Since the connectivity constraints and the proposed valid inequalities are exponential in the size of the problem, we devise different branch-and-cut schemes. Computational experiments performed on a set of problem instances demonstrate the effectiveness of the proposed valid inequalities in terms of strengthening the linear relaxation bounds as well as speeding up the solution procedure. Moreover, the results indicate the superiority of using a branch-and-cut methodology over a flow-based formulation. Finally, we discuss the relation between the problem parameters and the structure of optimal solutions based on the results of our experiments. © 2016 Elsevier Ltd