The following pages link to Francesco Carrabs (Q337569):
Displaying 30 items.
- 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)
- Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach (Q829168) (← links)
- The labeled maximum matching problem (Q1000970) (← links)
- (Q1041717) (redirect page) (← 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)
- An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints (Q1676485) (← links)
- On the complexity of rainbow spanning forest problem (Q1749772) (← links)
- The set orienteering problem (Q1754239) (← links)
- The rainbow spanning forest problem (Q1797922) (← links)
- A biased random-key genetic algorithm for the set orienteering problem (Q2030452) (← links)
- The generalized minimum branch vertices problem: properties and polyhedral analysis (Q2031951) (← links)
- Optimization of sensor battery charging to maximize lifetime in a wireless sensors network (Q2037885) (← links)
- Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading (Q2892373) (← links)
- A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem (Q3091541) (← links)
- Minimum Weighted Feedback Vertex Set on Diamonds (Q3439134) (← 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)
- An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem (Q5148188) (← links)
- A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks (Q5326779) (← links)
- The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions (Q6087141) (← links)
- A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs (Q6087142) (← links)
- A new formulation and a branch-and-cut algorithm for the set orienteering problem (Q6128935) (← links)
- An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading (Q6160334) (← links)
- A genetic approach for the 2‐edge‐connected minimum branch vertices problem (Q6180021) (← links)
- Corrigendum to: ``A new formulation and a branch-and-cut algorithm for the set orienteering problem'' (Q6565424) (← links)
- Solving the set covering problem with conflicts on sets: a new parallel GRASP (Q6568410) (← links)
