The following pages link to Fabrice Talla Nobibon (Q310348):
Displaying 19 items.
- Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
- Resource loading with time windows (Q319369) (← links)
- Scheduling modular projects on a bottleneck resource (Q398901) (← links)
- The interval ordering problem (Q423919) (← links)
- A note on testing axioms of revealed preference (Q495751) (← links)
- Optimization models for targeted offers in direct marketing: exact and heuristic algorithms (Q541729) (← links)
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment (Q709154) (← links)
- Heuristics for deciding collectively rational consumption behavior (Q719014) (← links)
- Minimum-cost diagnostic strategies for \(k\)-out-of-\(n\) systems with imperfect tests (Q1786885) (← links)
- Complexity results and exact algorithms for robust knapsack problems (Q2247901) (← links)
- Proactive and reactive strategies for football league timetabling (Q2282571) (← links)
- Complexity results for the weak axiom of revealed preference for collective consumption models (Q2348008) (← links)
- A combination of flow shop scheduling and the shortest path problem (Q2354293) (← links)
- Robust maximum weighted independent-set problems on interval graphs (Q2439511) (← links)
- On the complexity of testing the collective axiom of revealed preference (Q2638309) (← links)
- Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles (Q2815462) (← links)
- Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms (Q2957451) (← links)
- Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles (Q3578378) (← links)
- Pricing Toll Roads under Uncertainty (Q5240222) (← links)
