FPT-algorithms for some problems related to integer programming

In this paper, we present FPT-algorithms for special cases of the shortest lattice vector, integer linear programming, and simplex width computation problems, when matrices included in the problems' formulations are near square. The parameter is the maximum absolute value of rank minors of the corresponding matrices. Additionally, we present FPT-algorithms with respect to the same parameter for the problems, when the matrices have no singular rank sub-matrices.Comment: arXiv admin note: text overlap with arXiv:1710.00321 From author: some minor corrections has been don

Biased random-key genetic algorithm for bound-constrained global optimization

Global optimization seeks a minimum or maximum of a multimodal function over a discrete orcontinuous domain. In this paper, we propose a biased random-key genetic algorithm for findingapproximate solutions for continuous global optimization problems subject to box constraints. Experimentalresults illustrate its effectiveness on the robot kinematics problem, a challenging problemaccording to [7]

Transversality Conditions for Infinite Horizon Variational Problems on Time Scales

We consider problems of the calculus of variations on unbounded time scales. We prove the validity of the Euler-Lagrange equation on time scales for infinite horizon problems, and a new transversality condition.Comment: Submitted 6-October-2009; Accepted 19-March-2010 in revised form; for publication in "Optimization Letters"

A Study of Memetic Search with Multi-parent Combination for UBQP

We present a multi-parent hybrid genetic–tabu algorithm (denoted by GTA) for the Unconstrained Binary Quadratic Programming (UBQP) problem, by incorporating tabu search into the framework of genetic algorithm. In this paper, we propose a new multi-parent combination operator for generating offspring solutions. A pool updating strategy based on a quality-and-distance criterion is used to manage the population. Experimental comparisons with leading methods for the UBQP problem on 25 large public instances demonstrate the efficacy of our proposed algorithm in terms of both solution quality and computational efficiency