Monia Bellalouna

Orcid: 0000-0002-3261-9452

According to our database1, Monia Bellalouna authored at least 16 papers between 2009 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
An Improved Partitioning Heuristic for Solving TSP: An Empirical Study.
Proceedings of the 19th IEEE/ACIS International Conference on Software Engineering, 2018

Solving CSS-Sprite Packing Problem Using a Transformation to the Probabilistic Non-oriented Bin Packing Problem.
Proceedings of the Computational Science - ICCS 2018, 2018

A Hybrid Heuristic for the Probabilistic Capacitated Vehicle Routing Problem with Two-Dimensional Loading Constraints.
Proceedings of the Computational Science - ICCS 2018, 2018

A Parallel Branch and Bound Algorithm for the Probabilistic TSP.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2018

2017
An Exact Resolution for the Probabilistic Traveling Salesman Problem under the A Priori Strategy.
Proceedings of the International Conference on Computational Science, 2017

A parallel hybrid heuristic based on Karp's partitioning for PTSP on multi-core processors.
Proceedings of the 16th IEEE/ACIS International Conference on Computer and Information Science, 2017

2016
New fault tolerant strategy of wireless sensor network.
Proceedings of the 15th IEEE/ACIS International Conference on Computer and Information Science, 2016

2015
A branch and bound algorithm for the probabilistic traveling salesman problem.
Proceedings of the 16th IEEE/ACIS International Conference on Software Engineering, 2015

Wireless sensor networks modeling as a probabilistic combinatorial optimization problem.
Proceedings of the 16th IEEE/ACIS International Conference on Software Engineering, 2015

Stability of probablisitic two-stage permutation flowshop problem.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

A Java Implementation of the Branch and Bound Algorithm : the Probabilistic Traveling Salesman Problem.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

A Snail Heuristic for the Euclidean Traveling Salesman Problem.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
A probabilistic traveling salesman problem: a survey.
Proceedings of the Position Papers of the 2014 Federated Conference on Computer Science and Information Systems, 2014

2013
Load balancing a priori strategy for the probabilistic weighted flowtime problem.
Comput. Ind. Eng., 2013

2010
A priori parallel machines scheduling.
Comput. Ind. Eng., 2010

2009
A Priori Strategies for the Probabilistic Total Weighted Flowtime on Parallel Identical Machines Problem.
Proceedings of the 2009 International Conference on Foundations of Computer Science, 2009


  Loading...