The following pages link to Nicola Bianchessi (Q337148):
Displaying 20 items.
- Optimal interval scheduling with a resource constraint (Q337149) (← links)
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery (Q850302) (← links)
- A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites (Q856269) (← links)
- (Q1941379) (redirect page) (← links)
- Optimal solutions for routing problems with profits (Q1941380) (← links)
- The min-max close-enough arc routing problem (Q2116901) (← links)
- A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand (Q2208355) (← links)
- Directed weighted improper coloring for cellular channel allocation (Q2255043) (← links)
- The distance constrained multiple vehicle traveling purchaser problem (Q2256245) (← links)
- Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem (Q2424767) (← links)
- A branch-and-price algorithm for the robust graph coloring problem (Q2448920) (← links)
- A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts (Q2669559) (← links)
- The profitable close-enough arc routing problem (Q2669779) (← links)
- The split delivery capacitated team orienteering problem (Q2811321) (← links)
- Incomplete service and split deliveries in a routing problem with profits (Q4639689) (← links)
- A branch‐and‐cut algorithm for the Team Orienteering Problem (Q4642121) (← links)
- A column generation approach for the split delivery vehicle routing problem (Q5894493) (← links)
- On the zero-inventory-ordering policy in the inventory routing problem (Q6087504) (← links)
- On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm (Q6179695) (← links)
- Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems (Q6202345) (← links)
