The following pages link to Eduardo Uchoa (Q202059):
Displaying 50 items.
- Column generation approaches for the software clustering problem (Q301694) (← links)
- A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
- Unsplittable non-additive capacitated network design using set functions polyhedra (Q342169) (← links)
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery (Q376001) (← links)
- Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery (Q408394) (← links)
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems (Q621754) (← links)
- Improved lower bounds for the split delivery vehicle routing problem (Q991469) (← links)
- A facility location and installation of resources model for level of repair analysis (Q1011177) (← links)
- The \(\gamma\)-connected assignment problem (Q1307813) (← links)
- A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems (Q1651704) (← links)
- A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
- Limited memory rank-1 cuts for vehicle routing problems (Q1728212) (← links)
- New benchmark instances for the capacitated vehicle routing problem (Q1752871) (← links)
- Strong bounds with cut and column generation for class-teacher timetabling (Q1761917) (← links)
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem (Q1926856) (← links)
- The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199) (← links)
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems (Q1991111) (← links)
- Solving bin packing problems using VRPSolver models (Q2033390) (← links)
- A unified exact approach for clustered and generalized vehicle routing problems (Q2108132) (← links)
- The multiple Steiner TSP with order constraints: complexity and optimization algorithms (Q2156919) (← links)
- On the exact solution of vehicle routing problems with backhauls (Q2189917) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
- On the multiple Steiner traveling salesman problem with order constraints (Q2225050) (← links)
- Exact algorithms for the traveling salesman problem with draft limits (Q2256207) (← links)
- A generic exact solver for Vehicle Routing and related problems (Q2293094) (← links)
- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut (Q2299984) (← links)
- Improved branch-cut-and-price for capacitated vehicle routing (Q2398107) (← links)
- On the complete set packing and set partitioning polytopes: properties and rank 1 facets (Q2417173) (← links)
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657) (← links)
- Reduction tests for the prize-collecting Steiner problem (Q2466593) (← links)
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
- Formulations for a problem of petroleum transportation (Q2514812) (← links)
- Solving capacitated arc routing problems using a transformation to the CVRP (Q2581620) (← links)
- A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection (Q2664333) (← links)
- A POPMUSIC matheuristic for the capacitated vehicle routing problem (Q2669570) (← links)
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441) (← links)
- A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2688881) (← links)
- Dual heuristics on the exact solution of large Steiner problems (Q2741494) (← links)
- Solving replica placement and request distribution in content distribution networks (Q2883556) (← links)
- A hybrid GRASP with perturbations for the Steiner problem in graphs (Q2884534) (← links)
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem (Q2892153) (← links)
- The team orienteering problem: formulations and branch-cut and price (Q2917295) (← links)
- A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem (Q3057116) (← links)
- Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem (Q3091500) (← links)
- (Q3109941) (← links)
- (Q3439711) (← links)
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems (Q3564362) (← links)
- (Q4263730) (← links)
