18 results on '"Jean Mailfert"'
Search Results
2. Pipe-lining dynamic programming processes to synchronize both the production and the consumption of energy.
3. The weakly connected independent set polytope in corona and join of graphs.
4. The minimum weakly connected independent set problem: Polyhedral results and Branch-and-Cut.
5. On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm.
6. Composition of graphs and the Hop-constrained Path Problem.
7. The k edge-disjoint 3-hop-constrained paths polytope.
8. A branch-and-cut algorithm for the k-edge connected subgraph problem.
9. Extended cooperative networks games.
10. Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron.
11. Heuristics for Designing Energy-efficient Wireless Sensor Network Topologies.
12. Cooperative networks games with elastic demands.
13. On the independent dominating set polytope.
14. Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité.
15. Composition of Graphs and the Triangle-Free Subgraph Polytope.
16. Tarification par des jeux Coopératifs avec Demandes Élastiques.
17. Composition of graphs and the triangle free subgraph polytope.
18. Coeur et nucléolus des jeux de recouvrement.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.