4 Questions 8 Answers 0 Followers
Questions related from Nour El Houda Tellache
Given a directed acyclic graph G=(V,A) and a set A′ of A. It is well known that searching for a minimum number of vertex-disjoint paths that cover all the vertices of G can be solved in polynomial...
09 September 2019 3,409 1 View
Which statistical or Operation Research method can I use to sort nondominated solutions in a multi-objective problem?
12 December 2017 4,693 12 View
I have three heuristics H1, H2 and H3 that have been tested on a set of instances. For each triple (n,m,p) we have 100 instances. The performance criteria that have been used to compare between...
01 January 2017 6,699 7 View
Let G=(X U Y,E,P) a weighted bipartite graph, we need to find a matching of maximum cardinality for which the length of the longest edge is minimized.
08 August 2014 5,960 4 View
