The following pages link to Raffaele Cerulli (Q246847):
Displaying 16 items.
- Vehicle-ID sensor location for route flow recognition: models and algorithms (Q320044) (← links)
- Locating sensors to observe network arc flows: exact and heuristic approaches (Q336983) (← links)
- Maximizing lifetime in wireless sensor networks with multiple sensor families (Q337572) (← links)
- Lower and upper bounds for the spanning tree with minimum branch vertices (Q377727) (← links)
- Bounded-degree spanning tree problems: models and new algorithms (Q632386) (← links)
- Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach (Q829168) (← links)
- The labeled maximum matching problem (Q1000970) (← links)
- A linear time algorithm for the minimum weighted feedback vertex set on diamonds (Q1041719) (← links)
- A two-level metaheuristic for the all colors shortest path problem (Q1616945) (← links)
- Exact approaches for the orderly colored longest path problem: performance comparison (Q1628069) (← links)
- A novel discretization scheme for the close enough traveling salesman problem (Q1652067) (← links)
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257) (← links)
- Carousel greedy: a generalized greedy algorithm with applications in optimization (Q1652355) (← links)
- On the complexity of rainbow spanning forest problem (Q1749772) (← links)
- The set orienteering problem (Q1754239) (← links)
- OMEGA one multi ethnic genetic approach (Q5963233) (← links)
