The following pages link to Roberto Wolfler Calvo (Q188435):
Displaying 43 items.
- The static bicycle relocation problem with demand intervals (Q296779) (← links)
- An exact algorithm for the static rebalancing problem arising in bicycle sharing systems (Q319656) (← links)
- Fast machine reassignment (Q338866) (← links)
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560) (← links)
- A branch\&price\&cut algorithm for the vehicle routing problem with intermediate replenishment facilities (Q510949) (← links)
- A Branch-and-Cut method for the Capacitated Location-Routing Problem (Q622138) (← links)
- Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem (Q633484) (← links)
- A new effective unified model for solving the pre-marshalling and block relocation problems (Q724053) (← links)
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking (Q862819) (← links)
- Shared mobility systems (Q904286) (← links)
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem (Q975996) (← links)
- Shared mobility systems: an updated survey (Q1730532) (← links)
- Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks (Q1751162) (← links)
- (Q1868809) (redirect page) (← links)
- A heuristic approach to the overnight security service problem (Q1868811) (← links)
- A distributed geographic information system for the daily car pooling problem (Q1886004) (← links)
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697) (← links)
- A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← links)
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
- A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem (Q2029263) (← links)
- Efficient formulations for the traveling car renter problem and its quota variant (Q2047185) (← links)
- A constraints-aware reweighted feasibility pump approach (Q2060346) (← links)
- A benders squared \((B^2)\) framework for infinite-horizon stochastic linear programs (Q2063190) (← links)
- The Schrijver system of the flow cone in series-parallel graphs (Q2064292) (← links)
- Robustness of solutions to the capacitated facility location problem with uncertain demand (Q2091221) (← links)
- Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem (Q2379863) (← links)
- Solving the electricity production planning problem by a column generation based heuristic (Q2434329) (← links)
- Bike sharing systems: solving the static rebalancing problem (Q2445841) (← links)
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem (Q2459404) (← links)
- A metaheuristic to solve a location-routing problem with nonlinear costs (Q2491322) (← links)
- An effective and fast heuristic for the dial-a-ride problem (Q2644373) (← links)
- Efficient computation of shortest paths in time-dependent multi-modal networks (Q2828194) (← links)
- A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks (Q2835682) (← links)
- An exact method for the capacitated location-routing problem (Q2879523) (← links)
- UniALT for regular language contrained shortest paths on a multi-modal transportation network (Q2917259) (← links)
- A Matheuristic for the Dial-a-Ride Problem (Q3091527) (← links)
- On the Complexity of the Multiple Stack TSP, kSTSP (Q3630221) (← links)
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques (Q5085477) (← links)
- An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem (Q5301128) (← links)
- An exact algorithm for robust influence maximization (Q5918920) (← links)
- An exact algorithm for robust influence maximization (Q5919390) (← links)
- A heuristic for the vehicle routing problem with time windows (Q5937017) (← links)
- A trust-region framework for derivative-free mixed-integer optimization (Q6645947) (← links)
