Abstract: We show that new definitions of the notion of “projection” on which some of the recent “extended formulations” works (such as Kaibel (2011); Fiorini et al. (2011; 2012); Kaibel and Walter (2013); Kaibel and Weltge (2013) for example) have been based can cause those works to over-reach in their conclusions in relating polytopes to one another when the sets of the descriptive variables ...

In the last four decades, combinatorial optimization has been strongly influenced by linear programming. With the mathematical and algorithmic understanding of linear programs came a whole host of ideas and tools that were then applied to combinatorial optimization. Many of these ideas and tools are still in use today, and form the bedrock of our understanding of combinatorial optimization. One...

Combinatorial optimization problems have applications in a variety of sciences and engineering. In the presence of data uncertainty, these problems lead to stochastic combinatorial optimization problems which result in very large scale combinatorial optimization problems. In this paper, we report on the solution of some of the largest stochastic combinatorial optimization problem consisting of ...

Differential evolution is popular and efficient algorithm for global optimization. L-SHADE algorithm is one of the most successful adaptive versions of the algorithm. It uses only binomial crossover. We study employing the exponential crossover in the algorithm. Our tests are carried out on CEC2015 benchmark set for learning-based optimization competition. According to our results, the employin...

Correction to: S. Greco et al. (Eds.): Metaheuristics for Combinatorial Optimization, AISC 1332, https://doi.org/10.1007/978-3-030-68520-1 The book was inadvertently published with the incorrect volume number (1336) and this has been corrected now (1332).