André Rossi

Orcid: 0000-0002-3689-7185

According to our database1, André Rossi authored at least 70 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A survivable variant of the ring star problem.
Networks, March, 2024

A new upper bound based on Dantzig-Wolfe decomposition to maximize the stability radius of a simple assembly line under uncertainty.
Eur. J. Oper. Res., March, 2024

2023
An online method for robust target tracking using a wireless sensor network.
Expert Syst. Appl., November, 2023

A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem.
Comput. Oper. Res., May, 2023

2022
Solving robust bin-packing problems with a branch-and-price approach.
Eur. J. Oper. Res., 2022

Swarm intelligence, exact and matheuristic approaches for minimum weight directed dominating set problem.
Eng. Appl. Artif. Intell., 2022

Stability factor for robust balancing of simple assembly lines under uncertainty.
Discret. Appl. Math., 2022

A robust variant of the Ring Star Problem.
Proceedings of the 10th International Network Optimization Conference, 2022

2021
Focus distance-aware lifetime maximization of video camera-based wireless sensor networks.
J. Heuristics, 2021

Robust balancing of transfer lines with blocks of uncertain parallel tasks under fixed cycle time and space restrictions.
Eur. J. Oper. Res., 2021

Planning a multi-sensors search for a moving target considering traveling costs.
Eur. J. Oper. Res., 2021

Spatial and temporal robustness for scheduling a target tracking mission using wireless sensor networks.
Comput. Oper. Res., 2021

Multi-start iterated local search, exact and matheuristic approaches for minimum capacitated dominating set problem.
Appl. Soft Comput., 2021

2020
Two hybrid metaheuristic approaches for the covering salesman problem.
Neural Comput. Appl., 2020

Robust scheduling for target tracking using wireless sensor networks.
Comput. Oper. Res., 2020

2018
An exact approach to extend network lifetime in a general class of wireless sensor networks.
Inf. Sci., 2018

Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs.
Eur. J. Oper. Res., 2018

Minimum energy target tracking with coverage guarantee in wireless sensor networks.
Eur. J. Oper. Res., 2018

Properties and Exact Solution Approaches for the Minimum Cost Dominating Tree Problem.
Proceedings of the Distributed Computing and Internet Technology, 2018

2017
Bit-accurate energy estimation for Networks-on-Chip.
J. Syst. Archit., 2017

Energy Savings in Networks-on-Chip with Smart Temporal Shielding.
J. Low Power Electron., 2017

Heuristics for lifetime maximization in camera sensor networks.
Inf. Sci., 2017

Towards Effective Exact Algorithms for the Maximum Balanced Biclique Problem.
CoRR, 2017

Multiple neighborhood search, tabu search and ejection chains for the multi-depot open vehicle routing problem.
Comput. Ind. Eng., 2017

Improving the performance of embedded systems with variable neighborhood search.
Appl. Soft Comput., 2017

Energy aware Networks-on-Chip cortex inspired communication.
Proceedings of the 27th International Symposium on Power and Timing Modeling, 2017

2016
Formal Verification of Arithmetic Circuits by Function Extraction.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2016

Partial target coverage to extend the lifetime in wireless multi-role sensor networks.
Networks, 2016

Robust scheduling of wireless sensor networks for target tracking under uncertainty.
Eur. J. Oper. Res., 2016

Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations.
Discret. Appl. Math., 2016

A Two-Level solution approach to solve the Clustered Capacitated Vehicle Routing Problem.
Comput. Ind. Eng., 2016

Crosstalk-aware link power model for Networks-on-Chip.
Proceedings of the 2016 Conference on Design and Architectures for Signal and Image Processing (DASIP), 2016

2015
A multiple neighborhood search for dynamic memory allocation in embedded systems.
J. Heuristics, 2015

Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks.
Eur. J. Oper. Res., 2015

Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies.
Electron. Notes Discret. Math., 2015

Verification of gate-level arithmetic circuits by function extraction.
Proceedings of the 52nd Annual Design Automation Conference, 2015

2014
GRASP with ejection chains for the dynamic memory allocation in embedded systems.
Soft Comput., 2014

A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints.
Comput. Oper. Res., 2014

Function Extraction from Arithmetic Bit-Level Circuits.
Proceedings of the IEEE Computer Society Annual Symposium on VLSI, 2014

Multiple Mobile Target Tracking in Wireless Sensor Networks.
Proceedings of the Swarm Intelligence Based Optimization - First International Conference, 2014

2013
Iterative approaches for a dynamic memory allocation problem in embedded systems.
Eur. J. Oper. Res., 2013

Lifetime maximization in wireless directional sensor network.
Eur. J. Oper. Res., 2013

On the use of multiple sinks to extend the lifetime in connected wireless sensor networks.
Electron. Notes Discret. Math., 2013

An integrated design flow for the joint generation of control and interfaces from a business model.
Comput. Ind., 2013

A genetic algorithm based exact approach for lifetime maximization of directional sensor networks.
Ad Hoc Networks, 2013

Arithmetic Bit-Level Verification Using Network Flow Model.
Proceedings of the Hardware and Software: Verification and Testing, 2013

2012
Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints.
J. Sched., 2012

Column generation algorithm for sensor coverage scheduling under bandwidth constraints.
Networks, 2012

MemExplorer: From C Code to Memory Allocation.
J. Low Power Electron., 2012

New heuristics for two bounded-degree spanning tree problems.
Inf. Sci., 2012

A mathematical model and a metaheuristic approach for a memory allocation problem.
J. Heuristics, 2012

Connectivity-and-hop-constrained design of electricity distribution networks.
Eur. J. Oper. Res., 2012

An exact approach for maximizing the lifetime of sensor networks with adjustable sensing ranges.
Comput. Oper. Res., 2012

De l'optimisation dans les réseaux.
, 2012

2011
Three new upper bounds on the chromatic number.
Discret. Appl. Math., 2011

Tabu Search for Multiprocessor Scheduling: Application to High Level Synthesis.
Asia Pac. J. Oper. Res., 2011

A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty.
Ann. Oper. Res., 2011

On the Cover Scheduling Problem in Wireless Sensor Networks.
Proceedings of the Network Optimization - 5th International Conference, 2011

Algebraic approach to arithmetic design verification.
Proceedings of the International Conference on Formal Methods in Computer-Aided Design, 2011

Two Iterative Metaheuristic Approaches to Dynamic Memory Allocation for Embedded Systems.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2011

2010
A metaheuristic for the fixed job scheduling problem under spread time constraints.
Comput. Oper. Res., 2010

Joint generation of controls and interfaces for sociotechnical and reconfigurable systems.
Proceedings of the IEEE International Conference on Systems, 2010

An Artificial Bee Colony Algorithm for the 0-1 Multidimensional Knapsack Problem.
Proceedings of the Contemporary Computing - Third International Conference, 2010

2009
A Hybrid Grouping Genetic Algorithm for Multiprocessor Scheduling.
Proceedings of the Contemporary Computing - Second International Conference, 2009

Using Integer Linear Programming in Test-bench Generation for Evaluating Communication Processors.
Proceedings of the 12th Euromicro Conference on Digital System Design, 2009

Two Upper Bounds on the Chromatic Number.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint.
Eur. J. Oper. Res., 2008

2007
Generation of control for conveying systems based on component approach.
Proceedings of the IEEE International Conference on Systems, 2007

A component-based approach for conveying systems control design.
Proceedings of the ICINCO 2007, 2007

2005
A component based approach for the design of FMS control and supervision.
Proceedings of the IEEE International Conference on Systems, 2005


  Loading...