The following pages link to Carlos Diego Rodrigues (Q499366):
Displaying 7 items.
- On the complexity of the flow coloring problem (Q499367) (← links)
- A path-relinking algorithm for the multi-mode resource-constrained project scheduling problem (Q1651597) (← links)
- Strip based compact formulation for two-dimensional guillotine cutting problems (Q2108139) (← links)
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness (Q2147170) (← links)
- Optimizing the cost of preference manipulation in the graph model for conflict resolution (Q2662568) (← links)
- (Q4423732) (← links)
- 0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization (Q4915173) (← links)
