The following pages link to José-Manuel Belenguer (Q622137):
Displaying 9 items.
- A Branch-and-Cut method for the Capacitated Location-Routing Problem (Q622138) (← links)
- (Q1384093) (redirect page) (← links)
- The capacitated arc routing problem: Valid inequalities and facets (Q1384095) (← links)
- Separating capacity constraints in the CVRP using tabu search (Q1609917) (← links)
- (Q1870824) (redirect page) (← links)
- A cutting plane algorithm for the capacitated arc routing problem (Q1870825) (← links)
- Lower and upper bounds for the mixed capacitated arc routing problem (Q2496039) (← links)
- (Q5271456) (← links)
- Models and algorithms for a yard crane scheduling problem in container ports (Q6167632) (← links)
