Gotowe bibliografie tematyczne / Bicriteria shortest path / Artykuły w czasopismach
Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Bicriteria shortest path.

Artykuły w czasopismach na temat „Bicriteria shortest path”

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:

Sprawdź 19 najlepszych artykułów w czasopismach naukowych na temat „Bicriteria shortest path”.

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.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

Azaron, Amir. "Bicriteria shortest path in networks of queues". Applied Mathematics and Computation 182, nr 1 (listopad 2006): 434–42. http://dx.doi.org/10.1016/j.amc.2006.04.004.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Hamacher, Horst W., Stefan Ruzika i Stevanus A. Tjandra. "Algorithms for time-dependent bicriteria shortest path problems". Discrete Optimization 3, nr 3 (wrzesień 2006): 238–54. http://dx.doi.org/10.1016/j.disopt.2006.05.006.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Lin, Lin, i Mitsuo Gen. "An Effective Evolutionary Approach for Bicriteria Shortest Path Routing Problems". IEEJ Transactions on Electronics, Information and Systems 128, nr 3 (2008): 416–23. http://dx.doi.org/10.1541/ieejeiss.128.416.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Mohamed, Cheikh, Jarboui Bassem i Loukil Taicir. "A genetic algorithms to solve the bicriteria shortest path problem". Electronic Notes in Discrete Mathematics 36 (sierpień 2010): 851–58. http://dx.doi.org/10.1016/j.endm.2010.05.108.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

IDA, Kenichi, i Mitsuo GEN. "An Algorithm for Solving Bicriteria Shortest Path Problems with Fuzzy Coefficients". Journal of Japan Society for Fuzzy Theory and Systems 7, nr 1 (1995): 142–52. http://dx.doi.org/10.3156/jfuzzy.7.1_142.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Müller-Hannemann, Matthias, i Karsten Weihe. "On the cardinality of the Pareto set in bicriteria shortest path problems". Annals of Operations Research 147, nr 1 (18.08.2006): 269–86. http://dx.doi.org/10.1007/s10479-006-0072-1.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Funke, Stefan, i Sabine Storandt. "Polynomial-Time Construction of Contraction Hierarchies for Multi-Criteria Objectives". Proceedings of the International Symposium on Combinatorial Search 4, nr 1 (20.08.2021): 214–15. http://dx.doi.org/10.1609/socs.v4i1.18273.

Pełny tekst źródła
Streszczenie:
In this paper we consider a variant of the multi-criteria shortest path problem where the different criteria are combined in an arbitrary conic combination at query time. We show that contraction hierarchies (CH) — a very powerful speed-up technique originally developed for standard shortest path queries (Geisberger et al. 2008) — can be adapted to this scenario and lead - after moderate preprocessing effort - to query times that are orders of magnitudes faster than standard shortest path approaches. On the theory side we prove via some polyhedral considerations that the crucial node contraction operation during the CH construction can be performed in polynomial-time, while on the more practical side we complement our theoretical results with experiments on real-world data. Our approach extends previous results (Geisberger, Kobitzsch, and Sanders 2010) which only considered the bicriteria case. This is an extended abstract of the full paper published in (Funke and Storandt 2013).
Style APA, Harvard, Vancouver, ISO itp.
8

Hasuike, Takashi. "Robust shortest path problem based on a confidence interval in fuzzy bicriteria decision making". Information Sciences 221 (luty 2013): 520–33. http://dx.doi.org/10.1016/j.ins.2012.09.025.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Aboutahoun, Abdallah W. "Efficient solution generation for the bicriterion shortest path problems". International Journal of Operational Research 9, nr 3 (2010): 287. http://dx.doi.org/10.1504/ijor.2010.035522.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Chen, Peng, i Yu (Marco) Nie. "Bicriterion shortest path problem with a general nonadditive cost". Transportation Research Part B: Methodological 57 (listopad 2013): 419–35. http://dx.doi.org/10.1016/j.trb.2013.05.008.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
11

Chen, Peng (Will), i Yu (Marco) Nie. "Bicriterion Shortest Path Problem with a General Nonadditive Cost". Procedia - Social and Behavioral Sciences 80 (czerwiec 2013): 553–75. http://dx.doi.org/10.1016/j.sbspro.2013.05.030.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
12

Brumbaugh-Smith, J., i D. Shier. "An empirical investigation of some bicriterion shortest path algorithms". European Journal of Operational Research 43, nr 2 (listopad 1989): 216–24. http://dx.doi.org/10.1016/0377-2217(89)90215-4.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
13

Mote, John, Ishwar Murthy i David L. Olson. "A parametric approach to solving bicriterion shortest path problems". European Journal of Operational Research 53, nr 1 (lipiec 1991): 81–92. http://dx.doi.org/10.1016/0377-2217(91)90094-c.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
14

Skriver, A. J. V., i K. A. Andersen. "A label correcting approach for solving bicriterion shortest-path problems". Computers & Operations Research 27, nr 6 (maj 2000): 507–24. http://dx.doi.org/10.1016/s0305-0548(99)00037-4.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
15

Murthy, Ishwar, i David L. Olson. "An interactive procedure using domination cones for bicriterion shortest path problems". European Journal of Operational Research 72, nr 2 (styczeń 1994): 417–31. http://dx.doi.org/10.1016/0377-2217(94)90320-4.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
16

Machuca, E., L. Mandow, J. L. Pérez de la Cruz i A. Ruiz-Sepulveda. "A comparison of heuristic best-first algorithms for bicriterion shortest path problems". European Journal of Operational Research 217, nr 1 (luty 2012): 44–53. http://dx.doi.org/10.1016/j.ejor.2011.08.030.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
17

Widuch, Jacek. "A Relation of Dominance for the Bicriterion Bus Routing Problem". International Journal of Applied Mathematics and Computer Science 27, nr 1 (28.03.2017): 133–55. http://dx.doi.org/10.1515/amcs-2017-0010.

Pełny tekst źródła
Streszczenie:
Abstract A bicriterion bus routing (BBR) problem is described and analysed. The objective is to find a route from the start stop to the final stop minimizing the time and the cost of travel simultaneously. Additionally, the time of starting travel at the start stop is given. The BBR problem can be resolved using methods of graph theory. It comes down to resolving a bicriterion shortest path (BSP) problem in a multigraph with variable weights. In the paper, differences between the problem with constant weights and that with variable weights are described and analysed, with particular emphasis on properties satisfied only for the problem with variable weights and the description of the influence of dominated partial solutions on non-dominated final solutions. This paper proposes methods of estimation a dominated partial solution for the possibility of obtaining a non-dominated final solution from it. An algorithm for solving the BBR problem implementing these estimation methods is proposed and the results of experimental tests are presented.
Style APA, Harvard, Vancouver, ISO itp.
18

Beier, René, Heiko Röglin, Clemens Rösner i Berthold Vöcking. "The smoothed number of Pareto-optimal solutions in bicriteria integer optimization". Mathematical Programming, 27.09.2022. http://dx.doi.org/10.1007/s10107-022-01885-6.

Pełny tekst źródła
Streszczenie:
AbstractA well-established heuristic approach for solving bicriteria optimization problems is to enumerate the set of Pareto-optimal solutions. The heuristics following this principle are often successful in practice. Their running time, however, depends on the number of enumerated solutions, which is exponential in the worst case. We study bicriteria integer optimization problems in the model of smoothed analysis, in which inputs are subject to a small amount of random noise, and we prove an almost tight polynomial bound on the expected number of Pareto-optimal solutions. Our results give rise to tight polynomial bounds for the expected running time of the Nemhauser-Ullmann algorithm for the knapsack problem and they improve known results on the running times of heuristics for the bounded knapsack problem and the bicriteria shortest path problem.
Style APA, Harvard, Vancouver, ISO itp.
19

Craveirinha, José, Marta Pascoal i João Clímaco. "An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks". INFOR: Information Systems and Operational Research, 11.07.2023, 1–20. http://dx.doi.org/10.1080/03155986.2023.2228021.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
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!

Do bibliografii