The following pages link to Mauricio C. de Souza (Q276307):
Displayed 22 items.
- Models for scheduling charges in continuous casting: application to a Brazilian steel plant (Q276311) (← links)
- Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem (Q295887) (← links)
- Surgical scheduling with simultaneous employment of specialised human resources (Q319663) (← links)
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem (Q932185) (← links)
- Item:Q276307 (redirect page) (← links)
- Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration (Q983631) (← links)
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem (Q1025243) (← links)
- Item:Q276307 (redirect page) (← links)
- Variable neighborhood descent with iterated local search for routing and wavelength assignment (Q1761137) (← links)
- Flowshop scheduling problem with parallel semi-lines and final synchronization operation (Q2003426) (← links)
- Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks (Q2255986) (← links)
- GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem (Q2271122) (← links)
- Packing items to feed assembly lines (Q2384618) (← links)
- Local optimality conditions for multicommodity flow problems with separable piecewise convex costs (Q2643798) (← links)
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem (Q2892153) (← links)
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations (Q2914198) (← links)
- Stronger upper and lower bounds for a hard batching problem to feed assembly lines (Q3503545) (← links)
- (Q4519136) (← links)
- Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687) (← links)
- Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs (Q5449668) (← links)
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
- Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem (Q6091422) (← links)