The following pages link to Andrea Raiconi (Q337571):
Displaying 18 items.
- Maximizing lifetime in wireless sensor networks with multiple sensor families (Q337572) (← links)
- Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach (Q829168) (← links)
- (Q1616944) (redirect page) (← links)
- A two-level metaheuristic for the all colors shortest path problem (Q1616945) (← links)
- An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints (Q1676485) (← links)
- Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges (Q1926702) (← links)
- \(\alpha\)-coverage to extend network lifetime on wireless sensor networks (Q1936804) (← links)
- Optimization of sensor battery charging to maximize lifetime in a wireless sensors network (Q2037885) (← links)
- The knapsack problem with forfeits (Q2225068) (← links)
- Relations, models and a memetic approach for three degree-dependent spanning tree problems (Q2255965) (← links)
- Comparison of heuristics for the colourful travelling salesman problem (Q2256917) (← links)
- Exact and Metaheuristic Approaches to Extend Lifetime and Maintain Connectivity in Wireless Sensors Networks (Q3091543) (← links)
- Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem (Q3439489) (← links)
- Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations (Q4595321) (← links)
- Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints (Q4603928) (← links)
- A reduction heuristic for the all-colors shortest path problem (Q5002343) (← links)
- Contrasting the Spread of Misinformation in Online Social Networks (Q5139596) (← links)
- The knapsack problem with forfeit sets (Q6109304) (← links)