A5038772495- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Mobile Ad Hoc Networks
- Cooperative Communication and Network Coding
- graph theory and CDMA systems
- Limits and Structures in Graph Theory
- Advanced Wireless Network Optimization
- Optimization and Search Problems
- Optimization and Packing Problems
- Transportation Planning and Optimization
- Railway Systems and Energy Efficiency
- Advanced Combinatorial Mathematics
- Railway Engineering and Dynamics
- Data Management and Algorithms
- Advanced MIMO Systems Optimization
- Vehicle Routing Optimization Methods
- Advanced Manufacturing and Logistics Optimization
- Advanced Topics in Algebra
- Semantic Web and Ontologies
- Advanced Database Systems and Queries
- Advanced Algebra and Logic
- VLSI and FPGA Design Techniques
- Scheduling and Optimization Algorithms
- Advanced Optical Network Technologies
- Optimal Experimental Design Methods
Università degli Studi della Tuscia
2024
University of Salento
2009-2020
Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti
1987-2007
Istituto Nazionale di Fisica Nucleare, Sezione di Lecce
2000-2005
When train operations are perturbed, a new working timetable needs to be computed in real-time. In the literature, several algorithms have been proposed for optimizing this computation. This optimization usually does not consider energy consumption. However, minimizing consumption is central issue both from environmental and economic perspective. paper, we address real-time problem of The depends on driving regimes used by drivers. Hence, focus decision appropriate throughout each train's...
The estimation of running times is essential for the railway timetable definition. trains travel duration must respect some constraints, which depend on network. Usually, minimize They are typically calculated without considering energy consumption. green transportation has recently gained significant importance. In this paper, consumption in taken into account by defining an optimization problem to calculate This finds Precisely, algorithm handle with integration platform multi-objective...
This paper addresses the problem of simultaneously optimizing power consumption and routing in multi-hop wireless networks while forcing satisfaction required transmission demands between given origin–destination pairs. We devise a linear programming model for selection optimal routes schemes where both link capacity levels are suitably discretized. Since constraint matrix such contains huge number columns, we propose an exact algorithm its solution based on column-generation approach. The...
In this article the Lovász–Plummer clique reduction is extended to weighted case and used find a maximum weight stable set in claw-free graph G with n nodes O(n2(n2+L(n))) time, where L(n) complexity of finding augmenting path line H nodes. The best algorithm known date solve latter problem Gabow's matching (applied root H) which has O(n2logn). It follows that our can produce O(n4logn) time.
A graph $G(V, E)$ is \emph{claw-free} if no vertex has three pairwise non-adjacent neighbours. The Maximum Weight Stable Set (MWSS) Problem in a claw-free natural generalization of the Matching and been shown to be polynomially solvable by Minty Sbihi 1980. In remarkable paper, Faenza, Oriolo Stauffer have that, two-step procedure, can first turned into quasi-line removing strips containing all irregular nodes then decomposed \emph{\{claw, net\}-free} with stability number at most three....
The climate change emergency calls for a reduction in energy consumption all human activities and production processes. radio broadcasting industry is no exception. However, reducing requirements by uniformly cutting the radiated power at every transmitter can potentially impair quality of service. A careful evaluation optimization study are order. In this paper, analyzing Italian frequency modulation analog service, we show that it indeed possible to significantly reduce broadcasters...
A clutter$\mathcal{L}$ is a collection of subsets ground set $E( \mathcal{L} )$ with the property that, for every pair $A_i ,A_j \in \mathcal{L},A_i$ neither contained in nor contains $A_j$. cover $\mathcal{L}$ subset E intersecting member $\mathcal{L}$. The covering polytope$Q ( )$, associated clutter $\mathcal{L}$, convex hull incidence vectors covers polytope $Q provides common generalization several polytopes combinatorial optimization problems (stable set, knapsack, acyclic subdigraph,...