Fran├žais Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) Graphs, ALgorithms and Combinatorics
Some recent results on the integer linear programming formulation for the Max-Cut problem
Hung Nguyen

30 November 2018, 00:00
Salle/Bat : 445/PCRI-N
Contact :

Activités de recherche : Graph Theory

Résumé :
Given an undirected graph G=(V,E) where the edges are weighted by an arbitrary cost vector, a cut in G associated with a node subset S is the edge subset of E which contains all the edges having exactly one end-node in S.
The Maximum Cut problem which is to find a maximum total weight cut in G is one of the fundamental problems in combinatorial optimization.
The problem is NP-hard and has applications in many areas such as statistical physics, VLSI circuit design, scheduling, ...
Exact solutions for Max-Cut are usually based on mathematical formulations such as SDP for dense graphs and integer linear programming for sparse graphs.
The latter has non-compact formulations using cycle inequalities in the original space and compact (i.e., polynomial size) extended formulations using O(n^3) triangle inequalities defined on the complete graph of n vertices. In this talk, we show that one can simply reduce the number of triangle inequalities to O(nm).
We also present several extensions of the result for special sparse graphs and for graph partitioning problem.

Pour en savoir plus :
Séminaires
Refining Transitive and Pseudo-Transitive Relation
Web data management
Monday 24 January 2022 - 13:00
Salle : 455 - PCRI-N
Shuai Wang .............................................

Discovering Causal Rules in Knowledge Graphs using
Integration of Data and Knowledge
Monday 10 January 2022 - 15:00
Salle : 455 - PCRI-N
Lucas Simonne .............................................

Meta-Learning for Few-Shot Link Prediction in Know
Integration of Data and Knowledge
Monday 13 December 2021 - 13:00
Salle : 455 - PCRI-N
Taha Halal .............................................

Knowledge Graph Refinement based on Triplet BERT-N
Web data management
Monday 29 November 2021 - 13:00
Salle : 455 - PCRI-N
Armita Khajeh Nassiri .............................................

A Hyper-graph Approach for Computing EL+-Ontology
Automated Reasoning
Monday 15 November 2021 - 13:00
Salle : 445 - PCRI-N
Hui Yang .............................................