The following pages link to Roberto Baldacci (Q237398):
Displaying 50 items.
- Algorithms for nesting with defects (Q406491) (← links)
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
- (Q839837) (redirect page) (← links)
- Exact methods for large-scale multi-period financial planning problems (Q839841) (← links)
- Recent advances in vehicle routing exact algorithms (Q926561) (← links)
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← links)
- Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
- An exact solution framework for a broad class of vehicle routing problems (Q993700) (← links)
- Heuristic algorithms for the multi-depot ring-star problem (Q1043363) (← links)
- A bionomic approach to the capacitated \(p\)-median problem (Q1273663) (← links)
- A Benders decomposition-based framework for solving quay crane scheduling problems (Q1622801) (← links)
- The electric two-echelon vehicle routing problem (Q1634075) (← links)
- A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine (Q1653363) (← links)
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution (Q1681304) (← links)
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms (Q1683123) (← links)
- An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability (Q2029972) (← links)
- Scheduling heterogeneous delivery tasks on a mixed logistics platform (Q2076846) (← links)
- Robustness of solutions to the capacitated facility location problem with uncertain demand (Q2091221) (← links)
- A branch-and-price algorithm for the ring-tree facility location problem (Q2132327) (← links)
- Optimal Steiner trees under node and edge privacy conflicts (Q2156311) (← links)
- Capacitated ring arborescence problems with profits (Q2284638) (← links)
- Branch-and-cut algorithms for Steiner tree problems with privacy conflicts (Q2300046) (← links)
- A unified exact method for solving different classes of vehicle routing problems (Q2390996) (← links)
- Routing optimization with time windows under uncertainty (Q2414906) (← links)
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem (Q2489310) (← links)
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem (Q2643948) (← links)
- A column generation-based heuristic for a rehabilitation patient scheduling and routing problem (Q2676370) (← links)
- An Exact Method for the Vehicle Routing Problem with Backhauls (Q2783863) (← links)
- New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows (Q2815450) (← links)
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem (Q2879522) (← links)
- An Exact Method for the Capacitated Location-Routing Problem (Q2879523) (← links)
- An Exact Algorithm for the Period Routing Problem (Q3013932) (← links)
- Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs (Q3057117) (← links)
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows (Q3098764) (← links)
- A multi-depot period vehicle routing problem arising in the utilities sector (Q3157801) (← links)
- Exact methods based on node-routing formulations for undirected arc-routing problems (Q3376660) (← links)
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
- The Capacitated <i>m</i>-Ring-Star Problem (Q3392143) (← links)
- Routing a Heterogeneous Fleet of Vehicles (Q3564347) (← links)
- Some applications of the generalized vehicle routing problem (Q3585715) (← links)
- An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation (Q3637437) (← links)
- An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections (Q4422622) (← links)
- An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem (Q5301128) (← links)
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation (Q5321991) (← links)
- (Q5692625) (← links)
- A new method for solving capacitated location problems based on a set partitioning approach (Q5959081) (← links)
- The bus sightseeing problem (Q6080627) (← links)
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (Q6109802) (← links)
- Territorial design for customers with demand frequency (Q6112738) (← links)
- A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries (Q6121575) (← links)
