The following pages link to Moustapha Diaby (Q604760):
Displayed 28 items.
- Linear programming formulation of the set partitioning problem (Q604761) (← links)
- The indefinite period traveling salesman problem (Q724039) (← links)
- Hybrid genetic approach for solving large-scale capacitated cell formation problems with multiple routings (Q819106) (← links)
- Ensuring population diversity in genetic algorithms: a technical note with application to the cell formation problem (Q859950) (← links)
- Linear programming formulation of the vertex colouring problem (Q975796) (← links)
- Optimal setup time reduction for a single product with dynamic demands (Q1127154) (← links)
- (Q1198325) (redirect page) (← links)
- Capacitated lot-sizing and scheduling by Lagrangean relaxation (Q1198326) (← links)
- Efficient post-optimization analysis procedure for the dynamic lot-sizing problem (Q1261343) (← links)
- Multiple items procurement under stochastic nonstationary demands (Q1390261) (← links)
- Development and evaluation of an assignment heuristic for allocating cross-trained workers (Q1600882) (← links)
- A stochastic linear programming modelling and solution approach for planning the supply of rewards in loyalty reward programs (Q1753749) (← links)
- Project crashing in the presence of general non-linear activity time reduction costs (Q1758859) (← links)
- Limits to the scope of applicability of extended formulations theory for LP models of combinatorial optimisation problems (Q2204269) (← links)
- Shortening cycle times in multi-product, capacitated production environments through quality level improvements and setup reduction (Q2355104) (← links)
- Inventory rationing via drop-shipping in internet retailing: a sensitivity analysis (Q2576252) (← links)
- Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach (Q3087842) (← links)
- A price-directed decomposition approach for solving large-scale capacitated part-routing problems (Q3163241) (← links)
- Large-scale capacitated part-routing in the presence of process and routing flexibilities and setup costs (Q3182664) (← links)
- (Q3520785) (← links)
- Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problems (Q3984310) (← links)
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing (Q4015264) (← links)
- Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem (Q4285173) (← links)
- Preference Structure Modelling for Multi-objective Decision Making: A Goal-Programming Approach (Q4368571) (← links)
- A multiple-criteria decision methodology for the make-or-buy problem (Q4497115) (← links)
- Dynamic Lot Sizing for Multi-Echelon Distribution Systems with Purchasing and Transportation Price Discounts (Q5288138) (← links)
- (Q5392121) (← links)
- Advances in Combinatorial Optimization (Q5744058) (← links)