Zaloguj się

Gotowe bibliografie tematyczne / Multi-cover Problem

Spis treści

Artykuły w czasopismach

Gotowa bibliografia na temat „Multi-cover Problem”

Autor: Grafiati

Data publikacji: 6 września 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Multi-cover Problem”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Multi-cover Problem"

1

Mestre, Julián. "On the multi-radius cover problem." Information Processing Letters 99, no. 5 (2006): 195–98. http://dx.doi.org/10.1016/j.ipl.2006.04.012.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Hochbaum, Dorit S., and Asaf Levin. "The multi-integer set cover and the facility terminal cover problem." Networks 53, no. 1 (2009): 63–66. http://dx.doi.org/10.1002/net.20265.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Shi, Yishuo, Yingli Ran, Zhao Zhang, James Willson, Guangmo Tong, and Ding-Zhu Du. "Approximation algorithm for the partial set multi-cover problem." Journal of Global Optimization 75, no. 4 (2019): 1133–46. http://dx.doi.org/10.1007/s10898-019-00804-y.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Hu, Shuli, Xiaoli Wu, Huan Liu, Yiyuan Wang, Ruizhi Li, and Minghao Yin. "Multi-Objective Neighborhood Search Algorithm Based on Decomposition for Multi-Objective Minimum Weighted Vertex Cover Problem." Sustainability 11, no. 13 (2019): 3634. http://dx.doi.org/10.3390/su11133634.

Pełny tekst źródła

Streszczenie:

The multi-objective minimum weighted vertex cover problem aims to minimize the sum of different single type weights simultaneously. In this paper, we focus on the bi-objective minimum weighted vertex cover and propose a multi-objective algorithm integrating iterated neighborhood search with decomposition technique to solve this problem. Initially, we adopt the decomposition method to divide the multi-objective problem into several scalar optimization sub-problems. Meanwhile, to find more possible optimal solutions, we design a mixed score function according to the problem feature, which is app

Style APA, Harvard, Vancouver, ISO itp.

5

Kim, Suhwan. "Direction finder deployment based on the partial set multi-cover problem." International Journal of Management Science and Engineering Management 14, no. 2 (2018): 94–101. http://dx.doi.org/10.1080/17509653.2018.1500952.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Soleiman Mohammadi, Limaei, Lohmander Peter, and Olsson Leif. "Dynamic growth models for continuous cover multi-species forestry in Iranian Caspian forests." Journal of Forest Science 63, No. 11 (2017): 519–29. http://dx.doi.org/10.17221/32/2017-jfs.

Pełny tekst źródła

Streszczenie:

This study concerns some of the relevant topics of the Iranian Caspian forestry planning problem, in particular the first central components in this modelling process, such as forest modelling, forest statistics and growth function estimations. The required data was collected from Iranian Caspian forests. To do so, 201 sample plots were determined and the parameters such as number of trees, tree diameter at breast height and tree height were measured at each sample plot. Three sample plots at different 3 elevations were chosen to measure the tree increment. Data has been used to estimate a mod

Style APA, Harvard, Vancouver, ISO itp.

7

Zakarai, Mohammad, Hegazy Zaher, and Naglaa Ragaa. "Stochastic Local Search for Solving Chance-Constrained Multi-Manned U-shaped Assembly Line Balancing Problem with Time and Space Constraints." Journal of University of Shanghai for Science and Technology 23, no. 04 (2021): 278–95. http://dx.doi.org/10.51201/jusst/21/04242.

Pełny tekst źródła

Streszczenie:

The assembly line balancing problems have great importance in research and industry fields. They allow minimizing the learning aspects and guaranteeing a fixed number of products per day. This paper introduces a new problem that combines the multi-manned concept with the U-shaped lines with time and space constraints under uncertainty. The processing time of the tasks is considered as random variables with known means and variances. Therefore, chance-constraints appear in the cycle time constraints. In addition, each task has an associated area, where the assigned tasks per station are restric

Style APA, Harvard, Vancouver, ISO itp.

8

Nguyen, Lan N., and My T. Thai. "Minimum Robust Multi-Submodular Cover for Fairness." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 10 (2021): 9109–16. http://dx.doi.org/10.1609/aaai.v35i10.17100.

Pełny tekst źródła

Streszczenie:

In this paper, we study a novel problem, Minimum Robust Multi-Submodular Cover for Fairness (MinRF), as follows: given a ground set V; m monotone submodular functions f_1,...,f_m; m thresholds T_1,...,T_m and a non-negative integer r; MinRF asks for the smallest set S such that f_i(S \ X) ≥ T_i for all i ∈ [m] and |X| ≤ r. We prove that MinRF is inapproximable within (1- ε) ln m; and no algorithm, taking fewer than exponential number of queries in term of r, is able to output a feasible set to MinRF with high certainty. Three bicriteria approximation algorithms with performance guarantees are

Style APA, Harvard, Vancouver, ISO itp.

9

Stojkovic, Mirela, and François Soumis. "The operational flight and multi-crew scheduling problem." Yugoslav Journal of Operations Research 15, no. 1 (2005): 25–48. http://dx.doi.org/10.2298/yjor0501025s.

Pełny tekst źródła

Streszczenie:

This paper introduces a new kind of operational multi-crew scheduling problem which consists in simultaneously modifying, as necessary, the existing flight departure times and planned individual work days (duties) for the set of crew members, while respecting predefined aircraft itineraries. The splitting of a planned crew is allowed during a day of operations, where it is more important to cover a flight than to keep planned crew members together. The objective is to cover a maximum number of flights from a day of operations while minimizing changes in both the flight schedule and the next-da

Style APA, Harvard, Vancouver, ISO itp.

10

ABU-AFFASH, A. KARIM, PAZ CARMI, MATTHEW J. KATZ, and GILA MORGENSTERN. "MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS." International Journal of Computational Geometry & Applications 21, no. 06 (2011): 685–98. http://dx.doi.org/10.1142/s021819591100386x.

Pełny tekst źródła

Streszczenie:

We consider a geometric optimization problem that arises in sensor network design. Given a polygon P (possibly with holes) with n vertices, a set Y of m points representing sensors, and an integer k, 1 ≤ k ≤ m. The goal is to assign a sensing range, ri, to each of the sensors yi ∈ Y, such that each point p ∈ P is covered by at least k sensors, and the cost, [Formula: see text], of the assignment is minimized, where α is a constant. In this paper, we assume that α = 2, that is, find a set of disks centered at points of Y, such that (i) each point in P is covered by at least k disks, and (ii) th

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!