The following pages link to André Rossi (Q284846):
Displaying 32 items.
- Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations (Q284850) (← links)
- Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks (Q299776) (← links)
- Robust scheduling of wireless sensor networks for target tracking under uncertainty (Q322906) (← links)
- A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints (Q337213) (← links)
- An exact approach for maximizing the lifetime of sensor networks with adjustable sensing ranges (Q339664) (← links)
- Connectivity-and-hop-constrained design of electricity distribution networks (Q439454) (← links)
- A mathematical model and a metaheuristic approach for a memory allocation problem (Q519090) (← links)
- A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty (Q763115) (← links)
- Three new upper bounds on the chromatic number (Q765327) (← links)
- An exact approach to extend network lifetime in a general class of wireless sensor networks (Q781952) (← links)
- Minimum energy target tracking with coverage guarantee in wireless sensor networks (Q1681141) (← links)
- Robust balancing of transfer lines with blocks of uncertain parallel tasks under fixed cycle time and space restrictions (Q2029912) (← links)
- Planning a multi-sensors search for a moving target considering traveling costs (Q2030597) (← links)
- Solving robust bin-packing problems with a branch-and-price approach (Q2060393) (← links)
- Stability factor for robust balancing of simple assembly lines under uncertainty (Q2146745) (← links)
- Robust scheduling for target tracking using wireless sensor networks (Q2289953) (← links)
- Iterative approaches for a dynamic memory allocation problem in embedded systems (Q2356204) (← links)
- Cutting-plane-based algorithms for two branch vertices related spanning tree problems (Q2357824) (← links)
- Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints (Q2434297) (← links)
- Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint (Q2467258) (← links)
- Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies (Q2631232) (← links)
- A metaheuristic for the fixed job scheduling problem under spread time constraints (Q2654393) (← links)
- Spatial and temporal robustness for scheduling a target tracking mission using wireless sensor networks (Q2668762) (← links)
- TABU SEARCH FOR MULTIPROCESSOR SCHEDULING: APPLICATION TO HIGH LEVEL SYNTHESIS (Q2998843) (← links)
- An Artificial Bee Colony Algorithm for the 0–1 Multidimensional Knapsack Problem (Q3058830) (← links)
- On the Cover Scheduling Problem in Wireless Sensor Networks (Q3091546) (← links)
- A robustness measure of the configuration of multi-purpose machines (Q3163727) (← links)
- Column generation algorithm for sensor coverage scheduling under bandwidth constraints (Q5326765) (← links)
- A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem (Q6164361) (← links)
- A survivable variant of the ring star problem (Q6196876) (← links)
- Resilient and Survivable Ring Star Problems (Q6517830) (← links)
- A new upper bound based on Dantzig-Wolfe decomposition to maximize the stability radius of a simple assembly line under uncertainty (Q6555181) (← links)
