The following pages link to Isabel Méndez-Díaz (Q337477):
Displaying 24 items.
- A DSATUR-based algorithm for the equitable coloring problem (Q337479) (← links)
- 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)
- Solving a multicoloring problem with overlaps using integer programming (Q968150) (← links)
- A new formulation for the traveling deliveryman problem (Q1003469) (← links)
- An integer programming approach for the time-dependent traveling salesman problem with time windows (Q1651554) (← 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)
- (Q1854775) (redirect page) (← links)
- Facets of the graph coloring polytope (Q1854776) (← links)
- Analysis of a generalized linear ordering problem via integer programming (Q2009010) (← links)
- An exact algorithm for the edge coloring by total labeling problem (Q2178329) (← links)
- Pickup and delivery problem with incompatibility constraints (Q2333153) (← links)
- A polyhedral approach for the equitable coloring problem (Q2448876) (← links)
- A cutting plane algorithm for graph coloring (Q2467348) (← links)
- A branch-and-cut algorithm for graph coloring (Q2489906) (← links)
- Facets and valid inequalities for the time-dependent travelling salesman problem (Q2514741) (← links)
- (Q2741502) (← links)
- Polyhedral results for the Equitable Coloring Problem (Q2840701) (← 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 Tabu Search Heuristic for the Equitable Coloring Problem (Q3195344) (← links)
- A branch‐and‐price algorithm for the (<i>k,c</i>)‐coloring problem (Q4565766) (← links)
