2,093 research outputs found
Enhanced bi-directional dynamic programming algorithm for the resource constrained shortest path problem
No full textIn this paper we propose an enhanced bi-directional dynamic programming algorithm for the Resource Constrained Shortest Path, Righini and Salani (2006). In particular we study the join procedure, one of the time consuming components of the algorithm, and propose a dominance based join that uses binary search and Pareto frontier exploration. The proposed method can be used in both node-join and arc-join procedures. The computational experiments are performed on two classes of problems both describing complete graphs with negative cost cycles. On the first set, with a single resource consumption, the proposed procedure slightly improves the overall computational time with savings up to 8.4% for the B class and just 0.4% for the most time consuming class M. On the second set, with multiple resources consumption, the proposed procedure exhibits a remarkable improvement with an average speedup of 39.2%
Quintets. Arr - Don Mus.Ms. 1631 : ob, vl, vla (2), vlc; F
No full textVincenzo RighiniBearb.: Franz Joseph Rosinack. - Quelle: manuscript. - Provenienz: Fürstlich Fürstenbergische Hofbibliothek, DonaueschingenQuintetto. in F. | pour. | Oboe. | Violino. | Due Violle. | e | Violon Cello. | Del Sig: Righini. | A.ran M|r|e Rosinac
Reason, Experiment and Mysticism in the Scientific Revolution, ed. by M. L. Righini Bonelli et William R. Shea
No full textDe Buzon C. Reason, Experiment and Mysticism in the Scientific Revolution, ed. by M. L. Righini Bonelli et William R. Shea. In: Revue d'histoire des sciences, tome 29, n°2, 1976. pp. 175-176
Reason, Experiment and Mysticism in the Scientific Revolution, ed. by M. L. Righini Bonelli et William R. Shea
No full textDe Buzon C. Reason, Experiment and Mysticism in the Scientific Revolution, ed. by M. L. Righini Bonelli et William R. Shea. In: Revue d'histoire des sciences, tome 29, n°2, 1976. pp. 175-176
Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
No full textAbstractWhen vehicle routing problems with additional constraints, such as capacity or time windows, are solved via column generation and branch-and-price, it is common that the pricing subproblem requires the computation of a minimum cost constrained path on a graph with costs on the arcs and prizes on the vertices. A common solution technique for this problem is dynamic programming. In this paper we illustrate how the basic dynamic programming algorithm can be improved by bounded bi-directional search and we experimentally evaluate the effectiveness of the enhancement proposed. We consider as benchmark problems the elementary shortest path problems arising as pricing subproblems in branch-and-price algorithms for the capacitated vehicle routing problem, the vehicle routing problem with distribution and collection and the capacitated vehicle routing problem with time windows
Introduction
No full textSustainability has become an essential aspect of modern society, as we strive to protect the planet and ensure the well-being of future generations. While many sustainability efforts focus on global solutions, it's essential to recognize the importance of local communities in achieving sustainable development. Place-based sustainability is a concept that emphasizes the unique characteristics and needs of a particular location, including its natural resources, cultural heritage, and social dynamics.
Without respecting and nurturing ‘place’ we cannot achieve a state of ecological and social sustainability.
Place-based sustainability is a concept that emphasizes the importance of local ecosystems and communities in promoting sustainable development. It recognizes that each place has unique environmental, economic, cultural, and social characteristics that require tailored solutions to address challenges. This approach prioritizes the involvement of local stakeholders and the integration of traditional knowledge and cultural values
MEI encoding: 24 Variations on 'Vieni Amore' by Vincenzo Righini (WoO 65) by Ludwig van Beethoven
No full text24 Variations on 'Vieni Amore' by Vincenzo Righini, WoO 65 by Ludwig van Beethoven, encoding of Breitkopf und Härtel edition, 1862–90. Plate B.178
Schede: Villa La Paleotta a San Marino di Bentivoglio, La loggetta Lombardesca a Ravenna, La cattedrale di Faenza, L’Oratorio di San Sebastiano a Forlì, L’impianto urbanistico e architettonico di Terra del sole, La basilica di Santa Maria del Monte e la chiesa della Santissima Annunziata a Cesena, La chiesa di Santa Maria Assunta a Bagno di Romagna
No full textDynamic programming algorithms for the elementary shortest path problem with resource constraints
No full textWhen vehicle routing problems with additional constraints (e.g. capacities or time windows) are solved via column generation and branch-and-price, it is common that the pricing problem requires
the computation of a minimum cost constrained path on a graph with costs on the arcs and prizes on the nodes. The pricing problem is usually solved via dynamic programming in two possible ways: requiring elementary paths or allowing paths with cycles. We experimentally compare these two strategies and we evaluate the effectiveness of some algorithmic ideas to improve their performance
A note on the approximation of the Asymmetric Traveling Salesman Problem
No full textWe show that some asymmetric traveling salesman problem (ATSP) instances are approximable within bounds equal to 3 and 9/5, when they satisfy sufficient conditions more restrictive than the triangle inequality, very simple to test and nicely structured: they only depend on a measure of satisfaction of the triangle inequality and a measure of the graph asymmetry. We discuss the applicability of such conditions and we present two preprocessing linear programs to reformulate ATSP instances into equivalent ones achieving data-dependent bounds by the same approximation algorithms
- …
