The following pages link to Paula Zabala (Q342572):
Displayed 20 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)
- Solving a multicoloring problem with overlaps using integer programming (Q968150) (← links)
- A new formulation for the traveling deliveryman problem (Q1003469) (← links)
- A cluster-first route-second approach for the swap body vehicle routing problem (Q1695789) (← 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 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)
- An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem (Q2840722) (← 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 branch‐and‐price algorithm for the (<i>k,c</i>)‐coloring problem (Q4565766) (← links)
- A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows (Q6079872) (← links)
- Local search algorithms for the composite retrieval problem (Q6079877) (← links)
- Projective Splitting Algorithms for Integer Linear Programming Part 1: Pure Integer Programs (Q6250767) (← links)