The following pages link to Eduardo Uchoa (Q202059):
Displaying 16 items.
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows (Q4599317) (← links)
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation (Q5131729) (← links)
- Primal Heuristics for Branch and Price: The Assets of Diving Methods (Q5138257) (← links)
- Distance Transformation for Network Design Problems (Q5231681) (← links)
- Fast Local Search for Steiner Trees in Graphs (Q5233588) (← links)
- Hop‐level flow formulation for the survivable network design with hop constraints problem (Q5326786) (← links)
- Fast local search for the steiner problem in graphs (Q5406267) (← links)
- Improved Branch-Cut-and-Price for Capacitated Vehicle Routing (Q5419012) (← links)
- A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem (Q5432315) (← links)
- Integer Programming and Combinatorial Optimization (Q5712447) (← links)
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561) (← links)
- Vertex-disjoint packing of two Steiner trees: polyhedra and branch-and-cut (Q5943080) (← links)
- Solving vehicle routing problems with intermediate stops using VRPSolver models (Q6179690) (← links)
- Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems (Q6195060) (← links)
- A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery (Q6551059) (← links)
- VRPSolverEasy: a Python library for the exact solution of a rich vehicle routing problem (Q6598932) (← links)
