Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements

Iemetsa, O.; Yemetsa, O.
July 2012
Cybernetics & Systems Analysis;Jul2012, Vol. 48 Issue 4, p547
Academic Journal
Branching rules and the estimation of admissible subsets are proposed for minimization problems on the set of arrangements with a constant sum of the linear objective function for the branch and bound method. Two properties of the estimates are proved. These properties allow reducing the number of the admissible subsets being analyzed.


Related Articles

  • Better subset regression. Xiong, Shifeng // Biometrika;Mar2014, Vol. 101 Issue 1, p71 

    This paper studies the relationship between model fitting and screening performance to find efficient screening methods for high-dimensional linear regression models. Under a sparsity assumption we show in a general asymptotic setting that a subset that includes the true submodel always yields a...

  • Geometry of the multidimensional stability domain in the space of even (odd) coefficients of the characteristic polynomial of linear systems. Nikolaev, Yu. // Automation & Remote Control;Sep2014, Vol. 75 Issue 9, p1541 

    The necessary and sufficient conditions for asymptotic stability of the linear systems based on separate analysis of the spaces of even and odd coefficients of the characteristic polynomial were proposed. Consideration was given to the characteristic polynomials with positive and negative...

  • Suborbits in Knaster's problem. Bukh, Boris; Karasev, Roman N. // Bulletin of the London Mathematical Society;Apr2014, Vol. 46 Issue 2, p269 

    In this paper, we exhibit a similarity between Euclidean Ramsey problems and Knaster-type problems. By borrowing ideas from Ramsey theory, we prove weak Knaster properties of non-equatorial triangles in spheres, and of simplices in Euclidean spaces.

  • Biased random-key genetic algorithms for combinatorial optimization. Gon�alves, Jos�; Resende, Mauricio // Journal of Heuristics;Oct2011, Vol. 17 Issue 5, p487 

    Random-key genetic algorithms were introduced by Bean (ORSA J. Comput. 6:154-160, ) for solving sequencing problems in combinatorial optimization. Since then, they have been extended to handle a wide class of combinatorial optimization problems. This paper presents a tutorial on the...

  • New Perspectives on Human Problem Solving. Goldstone, Robert L.; Pizlo, Zygmunt // Journal of Problem Solving;Nov2009, Vol. 2 Issue 2, p1 

    Information about the 2nd workshop on human problem solving, held in November 2008 at Purdue University in West Lafayette, Indiana, is presented. It states that the workshop aimed to address a wider range of topics that reflect the scope of the "Journal of Problem Solving." It highlights several...

  • Evolutionary Algorithms for Vehicle Routing. Potvin, Jean-Yves // INFORMS Journal on Computing;Fall2009, Vol. 21 Issue 4, p518 

    This paper is a survey of the literature on applications of evolutionary algorithms for vehicle routing problems. It reports on genetic algorithms, evolution strategies, and particle swarm optimization when applied to the classical capacitated vehicle routing problem and many of its variants....

  • An Exact Method for the Minimum Cardinality Problem in the Treatment Planning of Intensity-Modulated Radiotherapy. Ernst, Andreas T.; Mak, Vicky H.; Mason, Luke R. // INFORMS Journal on Computing;Fall2009, Vol. 21 Issue 4, p562 

    In this paper, we introduce an exact method based on constraint programming ideas for a combinatorial optimization problem that arises from the treatment planning of intensity-modulated radiotherapy-the minimum cardinality problem (MCP). The MCP is to find a decomposition of a given integer...

  • Enhancing the performance of cuckoo search algorithm using orthogonal learning method. Li, Xiangtao; Wang, Jianan; Yin, Minghao // Neural Computing & Applications;May2014, Vol. 24 Issue 6, p1233 

    The cuckoo search algorithm is a simple and effective global optimization algorithm. It has been successfully applied to solve a wide range of real-world optimization problem. In this paper, we use a new search strategy based on orthogonal learning strategy to enhance the exploitation ability of...

  • An Improved Immune Algorithm for Multiobjective Flexible Job-shop Scheduling. Hongquan Xue; Peng Zhang; Shengmin Wei; Lin Yang // Journal of Networks;Oct2014, Vol. 9 Issue 10, p2843 

    Flexible job-shop scheduling problem derived from the job-shop scheduling problem, and is more realistic than the job-shop scheduling problem in the manufacturing enterprise. It should be utilized with high efficiency. But it is a multi-objective optimal problem. Three minimization objectives...


Read the Article


Sign out of this library

Other Topics