The following pages link to Cláudio Alves (Q297178):
Displaying 19 items.
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem (Q297181) (← links)
- Skewed general variable neighborhood search for the location routing scheduling problem (Q337608) (← links)
- An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling (Q342571) (← links)
- On the extremality of maximal dual feasible functions (Q433834) (← links)
- A survey of dual-feasible and superadditive functions (Q610986) (← links)
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model (Q635160) (← links)
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
- Theoretical investigations on maximal dual feasible functions (Q974987) (← links)
- New lower bounds based on column generation and constraint programming for the pattern minimization problem (Q1025240) (← links)
- Variable neighborhood search algorithms for pickup and delivery problems with loading constraints (Q1687656) (← links)
- Column generation based primal heuristics for routing and loading problems (Q1742212) (← links)
- Column generation based approaches for combined routing and scheduling (Q1742215) (← links)
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints (Q1751662) (← links)
- Constructing general dual-feasible functions (Q1785396) (← links)
- Worst-case analysis of maximal dual feasible functions (Q1926616) (← links)
- Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
- Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
- Arc-flow model for the two-dimensional guillotine cutting stock problem (Q2654387) (← links)
- New Stabilization Procedures for the Cutting Stock Problem (Q2899145) (← links)
