Results 231 to 240 of about 1,714,979 (285)
Some of the next articles are maybe not open access.
Theory of Computing Systems, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lampis, Michael, Mitsou, Valia
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lampis, Michael, Mitsou, Valia
openaire +2 more sources
Naval Research Logistics (NRL), 2004
AbstractIn this paper we investigate the gradual covering problem. Within a certain distance from the facility the demand point is fully covered, and beyond another specified distance the demand point is not covered. Between these two given distances the coverage is linear in the distance from the facility.
Drezner, Zvi +2 more
openaire +2 more sources
AbstractIn this paper we investigate the gradual covering problem. Within a certain distance from the facility the demand point is fully covered, and beyond another specified distance the demand point is not covered. Between these two given distances the coverage is linear in the distance from the facility.
Drezner, Zvi +2 more
openaire +2 more sources
Operations Research, 1997
The Covering Tour Problem (CTP) is defined on a graph G = (V ∪ W, E), where W is a set of vertices that must be covered. The CTP consists of determining a minimum length Hamiltonian cycle on a subset of V such that every vertex of W is within a prespecified distance from the cycle.
Gendreau, Michel +2 more
openaire +1 more source
The Covering Tour Problem (CTP) is defined on a graph G = (V ∪ W, E), where W is a set of vertices that must be covered. The CTP consists of determining a minimum length Hamiltonian cycle on a subset of V such that every vertex of W is within a prespecified distance from the cycle.
Gendreau, Michel +2 more
openaire +1 more source
On Conditional Covering Problem
Mathematics in Computer Science, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sivan, Balasubramanian +2 more
openaire +1 more source
Theory of Probability & Its Applications, 1994
Summary: For a simple symmetric random walk on the lattice \(\mathbb{Z}^ d\), let \(S_ n = X_ 1 + \cdots + X_ n\) and let \(X_ 1, X_ 2, \dots\) be a sequence of independent and identically distributed random vectors with \[ {\mathbf P}\{X_ i = e_ i\} = {\mathbf P}\{X_ i = -e_ i\} = {1\over 2d}\quad (i = 1,2, \dots, d), \] where \(e_ 1,e_ 2, \dots, e_ d\
openaire +2 more sources
Summary: For a simple symmetric random walk on the lattice \(\mathbb{Z}^ d\), let \(S_ n = X_ 1 + \cdots + X_ n\) and let \(X_ 1, X_ 2, \dots\) be a sequence of independent and identically distributed random vectors with \[ {\mathbf P}\{X_ i = e_ i\} = {\mathbf P}\{X_ i = -e_ i\} = {1\over 2d}\quad (i = 1,2, \dots, d), \] where \(e_ 1,e_ 2, \dots, e_ d\
openaire +2 more sources
Algorithmica, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uriel Feige, Yael Hitron
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uriel Feige, Yael Hitron
openaire +1 more source
Transportation Science, 1989
The primary purpose of this paper is to introduce and mathematically formulate the covering salesman problem (CSP). The CSP may be stated as follows: identify the minimum cost tour of a subset of n given cities such that every city not on the tour is within some predetermined covering distance standard, S, of a city that is on the tour. The CSP may be
Current, John R., Schilling, David A.
openaire +2 more sources
The primary purpose of this paper is to introduce and mathematically formulate the covering salesman problem (CSP). The CSP may be stated as follows: identify the minimum cost tour of a subset of n given cities such that every city not on the tour is within some predetermined covering distance standard, S, of a city that is on the tour. The CSP may be
Current, John R., Schilling, David A.
openaire +2 more sources
Bond covering in the lattice-covering problem
Physical Review A, 1992In this paper, we study the problem of the covering of the bonds of a finite lattice by a random walk that visits all the lattice sites. One-, two-, three-, and four-dimensional regular periodic lattices are considered. While in one-dimension the problem is trivial, our numerical results show very interesting features in higher dimensions, concerning ...
CASSI, Davide, L. SONCINI
openaire +3 more sources