Displaying similar documents to “New lower bounds for Heilbronn numbers.”

An ex-post bound on the greedy heuristic for the uncapacitated facility location problem

Jean-Michel Thizy (2006)

RAIRO - Operations Research

Similarity:

A bound for the greedy heuristic applied to the K-facility location problem can be calculated, using values gathered during the calculation of the heuristic. The bound strengthens a well-known bound for the heuristic. Computational experiments show that this bound can be beneficial when the number of facilities is small or close to the total number of potential sites. In addition, it is consistent with previous results about the influence of the data characteristics upon the optimal...

Bounds for the first Dirichlet eigenvalue of triangles and quadrilaterals

Pedro Freitas, Batłomiej Siudeja (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We prove some new upper and lower bounds for the first Dirichlet eigenvalue of triangles and quadrilaterals. In particular, we improve Pólya and Szegö's [  (1951)] lower bound for quadrilaterals and extend Hersch's [  (1966) 457–460] upper bound for parallelograms to general quadrilaterals.

A Variable Neighborhood Search Approach for Solving the Maximum Set Splitting Problem

Matic, Dragan (2012)

Serdica Journal of Computing

Similarity:

This paper presents a Variable neighbourhood search (VNS) approach for solving the Maximum Set Splitting Problem (MSSP). The algorithm forms a system of neighborhoods based on changing the component for an increasing number of elements. An efficient local search procedure swaps the components of pairs of elements and yields a relatively short running time. Numerical experiments are performed on the instances known in the literature: minimum hitting set and Steiner triple systems. Computational...

Lower bounds for the scheduling problem with uncertain demands

Djamel Berkoune, Khaled Mesghouni, Besoa Rabenasolo (2006)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper proposes various lower bounds to the makespan of the flexible job shop scheduling problem (FJSP). The FJSP is known in the literature as one of the most difficult combinatorial optimisation problems (NP-hard). We will use genetic algorithms for the optimisation of this type of problems. The list of the demands is divided in two sets: the actual demand, which is considered as certain (a list of jobs with known characteristics), and the predicted demand, which is a list of uncertain...

Guessing secrets.

Chung, Fan, Graham, Ronald, Leighton, Tom (2001)

The Electronic Journal of Combinatorics [electronic only]

Similarity: