The following pages link to Laurent Alfandari (Q496642):
Displaying 24 items.
- (Q336408) (redirect page) (← links)
- Hybrid column generation for large-size covering integer programs: application to transportation planning (Q336412) (← links)
- Fast machine reassignment (Q338866) (← links)
- A note on the clustered set covering problem (Q496643) (← links)
- Edge cover by connected bipartite subgraphs (Q646717) (← links)
- A MIP flow model for crop-rotation planning in a context of forest sustainable development (Q666488) (← links)
- Solving utility-maximization selection problems with multinomial logit demand: is the first-choice model a good approximation? (Q827131) (← links)
- Master-slave strategy and polynomial approximation (Q1588828) (← links)
- Robust optimization for non-linear impact of data variation (Q1654345) (← links)
- Optimizing healthcare network design under reference pricing and parameter uncertainty (Q1694841) (← links)
- Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem (Q1725626) (← links)
- Robust location of new housing developments using a choice model (Q1730557) (← links)
- An exact method for assortment optimization under the nested logit model (Q2030643) (← links)
- Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
- A tailored Benders decomposition approach for last-mile delivery with autonomous robots (Q2077920) (← links)
- Designing an optimal sequence of non-pharmaceutical interventions for controlling COVID-19 (Q2160528) (← links)
- Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach (Q2184040) (← links)
- Solving the electricity production planning problem by a column generation based heuristic (Q2434329) (← links)
- A branch-and-price-and-cut approach for sustainable crop rotation planning (Q2629731) (← links)
- Approximation of the Clustered Set Covering Problem (Q2883599) (← links)
- (Q3061957) (← links)
- (Q3070855) (← links)
- (Q4258252) (← links)
- Improved approximation of the general soft-capacitated facility location problem (Q4600614) (← links)
