Strength of facets for the set covering and set packing polyhedra on circulant matrices

2009 ◽  
Vol 35 ◽  
pp. 109-114 ◽  
Author(s):  
S. Bianchi ◽  
M.S. Montelar ◽  
M. Escalante
2008 ◽  
Vol 16 (1) ◽  
pp. 127-147 ◽  
Author(s):  
Anton V. Eremeev

We consider the optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The optimal recombination is studied in the case where a vector of binary variables is used as a solution encoding. By means of efficient reductions of the optimal recombination problems (ORPs) we show the polynomial solvability of the ORPs for the maximum weight set packing problem, the minimum weight set partition problem, and for linear Boolean programming problems with at most two variables per inequality, and some other problems. We also identify several NP-hard cases of optimal recombination: the Boolean linear programming problems with three variables per inequality, the knapsack, the set covering, the p-median, and some other problems.


2012 ◽  
Vol 160 (18) ◽  
pp. 2555-2562
Author(s):  
Silvia M. Bianchi ◽  
Mariana S. Escalante ◽  
M. Susana Montelar

2009 ◽  
Vol 6 (2) ◽  
pp. 162-173 ◽  
Author(s):  
Gabriela R. Argiroffo ◽  
Silvia M. Bianchi

2013 ◽  
Vol 79 (1) ◽  
pp. 69-85 ◽  
Author(s):  
Silvia M. Bianchi ◽  
Graciela L. Nasini ◽  
Paola B. Tolomei

2014 ◽  
Vol 166 ◽  
pp. 59-70 ◽  
Author(s):  
S. Bianchi ◽  
G. Nasini ◽  
P. Tolomei

Sign in / Sign up

Export Citation Format

Share Document