Jean Mailfert

According to our database1, Jean Mailfert authored at least 24 papers between 2000 and 2022.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Surrogate Estimators for Complex Bi-Level Energy Management.
Proceedings of the Communication Papers of the 17th Conference on Computer Science and Intelligence Systems, 2022

A Synchronized Knapsack Problem.
Proceedings of the 8th International Conference on Control, 2022

2021
Pipe-lining dynamic programming processes to synchronize both the production and the consumption of energy.
RAIRO Oper. Res., 2021

Synchronizing energy production and vehicle routing.
RAIRO Oper. Res., 2021

2020
Pipe-lining Dynamic Programming Processes in Order to Synchronize Energy Production and Consumption.
Proceedings of the 2020 Federated Conference on Computer Science and Information Systems, 2020

Dynamic Programming for the Synchronization of Energy Production and Consumption Processes.
Proceedings of the Recent Advances in Computational Optimization, 2020

Simultaneous Management of Energy Production and Consumption.
Proceedings of the 7th International Conference on Control, 2020

2018
The weakly connected independent set polytope in corona and join of graphs.
J. Comb. Optim., 2018

2016
The minimum weakly connected independent set problem: Polyhedral results and Branch-and-Cut.
Discret. Optim., 2016

2015
On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm.
RAIRO Oper. Res., 2015

2012
Composition of graphs and the Hop-constrained Path Problem.
Int. J. Math. Oper. Res., 2012

2010
A branch-and-cut algorithm for the <i>k</i>-edge connected subgraph problem.
Networks, 2010

The k edge-disjoint 3-hop-constrained paths polytope.
Discret. Optim., 2010

2009
Heuristics for Designing Energy-efficient Wireless Sensor Network Topologies.
J. Networks, 2009

Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron.
J. Comb. Optim., 2009

Extended cooperative networks games.
Discret. Appl. Math., 2009

2008
An Optimization Approach for Designing Wireless Sensor Networks.
Proceedings of the NTMS 2008, 2008

2007
Cooperative networks games with elastic demands.
RAIRO Oper. Res., 2007

The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut.
Proceedings of the 6th International Workshop on Design and Reliable Communication Networks, 2007

2006
On the independent dominating set polytope.
Eur. J. Comb., 2006

2005
Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité.
RAIRO Oper. Res., 2005

2001
Tarification par des jeux Coopératifs avec Demandes Élastiques.
RAIRO Oper. Res., 2001

2000
Coeur et nucléolus des jeux de recouvrement.
RAIRO Oper. Res., 2000

Composition of graphs and the triangle free subgraph polytope.
Electron. Notes Discret. Math., 2000


  Loading...