The following pages link to Raffaele Cerulli (Q246847):
Displaying 50 items.
- (Q201770) (redirect page) (← links)
- 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)
- Mean-variance approach to the management of cyclic deliveries (Q1116874) (← links)
- The auction technique for the sensor based navigation planning of an autonomous mobile robot (Q1383989) (← links)
- Shortest path auction algorithm without contractions using virtual source concept (Q1415485) (← 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)
- 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)
- Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges (Q1926702) (← links)
- The generalized minimum branch vertices problem: properties and polyhedral analysis (Q2031951) (← 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)
- Efficient preflow push algorithms (Q2471239) (← links)
- An iterative multiparametric approach for determining the location of AVI sensors for robust route flow estimation (Q2669700) (← 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)
- Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem (Q3439489) (← links)
- A class of manpower scheduling problems (Q4000927) (← links)
- A multiplier adjustment technique for the capacitated concentrator location problem (Q4227929) (← links)
- (Q4527189) (← 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)
- The Rainbow Cycle Cover Problem (Q4642402) (← links)
- (Q4945410) (← links)
- A reduction heuristic for the all-colors shortest path problem (Q5002343) (← links)
- Contrasting the Spread of Misinformation in Online Social Networks (Q5139596) (← links)
- An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem (Q5148188) (← links)
- Operations management in distribution networks within a smart city framework (Q5234099) (← links)
- A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks (Q5326779) (← links)
- Graph collapsing in shortest path auction algorithms (Q5942938) (← links)
- OMEGA one multi ethnic genetic approach (Q5963233) (← links)
- Grocery distribution plans in urban networks with street crossing penalties (Q6065827) (← links)
- A new formulation and a branch-and-cut algorithm for the set orienteering problem (Q6128935) (← links)
- Quantifying outcome functions of linear programs: an approach based on interval-valued right-hand sides (Q6145049) (← links)
- An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading (Q6160334) (← links)
- Shortest paths with exclusive-disjunction arc pairs conflicts (Q6164356) (← links)
