The following pages link to Juan José Miranda-Bront (Q342573):
Displaying 16 items.
- An ILP based heuristic for a generalization of the post-enrollment course timetabling problem (Q342574) (← links)
- A branch-and-cut algorithm for the latent-class logit assortment problem (Q496669) (← links)
- An integer programming approach for the time-dependent traveling salesman problem with time windows (Q1651554) (← links)
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment (Q1652330) (← links)
- A cluster-first route-second approach for the swap body vehicle routing problem (Q1695789) (← links)
- An ILP-based local search procedure for the VRP with pickups and deliveries (Q1698289) (← links)
- A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints (Q2029262) (← links)
- Facets and valid inequalities for the time-dependent travelling salesman problem (Q2514741) (← links)
- An integer programming approach for the time-dependent TSP (Q2883581) (← links)
- A branch-and-cut algorithm for the latent class logit assortment problem (Q2883584) (← links)
- A Column Generation Algorithm for Choice-Based Network Revenue Management (Q3100383) (← links)
- A branch‐and‐price algorithm for the (<i>k,c</i>)‐coloring problem (Q4565766) (← links)
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801) (← links)
- A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows (Q6087498) (← links)
- Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows (Q6092647) (← links)
- On incorporating variable consumption functions within energy-efficient parallel machine scheduling (Q6759394) (← links)
