Thierry Mautor

According to our database1, Thierry Mautor authored at least 19 papers between 1993 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies.
CoRR, 2023

2022
A polynomial algorithm for deciding the validity of an electrical distribution tree.
Inf. Process. Lett., 2022

2021
Optimisation of electrical network configuration: Complexity and algorithms for ring topologies.
Theor. Comput. Sci., 2021

2020
Charging management of shared taxis: Neighbourhood search for the E-ADARP.
Proceedings of the 23rd IEEE International Conference on Intelligent Transportation Systems, 2020

2017
A learning algorithm to minimize the expectation time of finding a parking place in urban area.
Proceedings of the 2017 IEEE Symposium on Computers and Communications, 2017

2016
Learning techniques for cloud demands aggregation in cloud service brokering.
Int. J. Cloud Comput., 2016

2015
Bin packing with fragmentable items: Presentation and approximations.
Theor. Comput. Sci., 2015

Smoothing the Input Process in a Batch Queue.
Proceedings of the Information Sciences and Systems 2015, 2015

2014
A Bit-Parallel Russian Dolls Search for a Maximum Cardinality Clique in a Graph.
CoRR, 2014

2012
La théorie des jeux pour l'établissement des contrats dans les réseaux interdomaines
CoRR, 2012

Game theory for contracts establishment with guaranteed QoS in the interdomain network.
Proceedings of the International Conference on Communications and Information Technology, 2012

2011
SLA Establishment with Guaranteed QoS in the Interdomain Network: A Stock Model
CoRR, 2011

2009
Impact of Alliances on End-to-End QoS Satisfaction in an Interdomain Network.
Proceedings of IEEE International Conference on Communications, 2009

2007
Arcs-states models for the vehicle routing problem with time windows and related problems.
Comput. Oper. Res., 2007

2004
Fixed Size and Variable Size Packet Models in an Optical Ring Network: Complexity and Simulations.
Proceedings of the Computer and Information Sciences, 2004

1996
Building a parallel branch and bound library.
Proceedings of the Solving Combinatorial Optimization Problems in Parallel, 1996

1994
A New Exact Algorithm for the Solution of Quadratic Assignment Problems.
Discret. Appl. Math., 1994

Concurrent data structures and load balancing strategies for parallel branch-and-bound/A* algorithms.
Proceedings of the Parallel Algorithms, 1994

1993
Difficulties of Exact Methods for Solving the Quadratic Assignment Problem.
Proceedings of the Quadratic Assignment and Related Problems, 1993


  Loading...