Results 21 to 30 of about 284 (55)

Dense Packings of Congruent Circles in Rectangles with a Variable Aspect Ratio

, 2003
We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles.
A Thue, BD Lubachevsky, JH Folkman, KJ Nurmela, KJ Nurmela, KJ Nurmela, L Fejes-Toth, M Ruda, N Oler, RL Graham, Z Füuredi   +10 more
core   +3 more sources

A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber

EURO Journal on Computational Optimization, 2020
Integrated packing and sequence-optimization problems appear in many industrial applications. As an example of this type of problem, we consider the production of glued laminated timber (glulam) in sawmills: Wood beams must be packed into a sequence of ...
Heiner Ackermann, Erik Diessel
doaj  

Matching with Couples: a Multidisciplinary Survey [PDF]

, 2011
This survey deals with two-sided matching markets where one set of agents (workers/residents) has to be matched with another set of agents (firms/hospitals). We first give a short overview of a selection of classical results.
Biró, Péter, Klijn, Flip
core  

Discovering a junction tree behind a Markov network by a greedy algorithm

, 2011
In an earlier paper we introduced a special kind of k-width junction tree, called k-th order t-cherry junction tree in order to approximate a joint probability distribution.
A Altmüller, C Berge, CK Chow, D Karger, E Kovács, E Kovács, Edith Kovács, FM Malvestuto, FM Malvestuto, FR Bach, J Bukszár, J Bukszár, J Pearl, K Nunez, M Yanakakis, N Wermuth, N Wermuth, RE Tarjan, RG Cowell, S Kullback, SL Lauritzen, T Szántai, T Szántai, T Szántai, Tamás Szántai, TM Cover, Y Bishop, Y Xiang   +27 more
core   +1 more source

State Transition Algorithm

, 2012
In terms of the concepts of state and state transition, a new heuristic random search algorithm named state transition algorithm is proposed. For continuous function optimization problems, four special transformation operators called rotation ...
A. H. Wright, A. K. Qin, C. Hamzacebi, C. Hamzacebi, D. D. Burgess, D. E. Goldberg, D. H. Wolpert, D. W. Stroock, F. J. Solis, F. V. Berth, G. Albeanu, G. Rudolph, H. A. Abbass, J. A. Nelder, J. C. Lagarias, J. J. Liang, J. Kennedy, J. Matyas, J. Y. Li, K. Deb, K. F. C. Yiu, P. Collet, R. C. Eberhart, R. Hooke, R. Storn, T. D. Tran, T. W. Leung, T. Zhang, X. J. Zhou, X. J. Zhou, X. S. Yang, Y. H. Shi, Y. X. Yuan, Z. Michalewicz   +33 more
core   +1 more source

Lotsize optimization leading to a $p$-median problem with cardinalities [PDF]

, 2007
We consider the problem of approximating the branch and size dependent demand of a fashion discounter with many branches by a distributing process being based on the branch delivery restricted to integral multiples of lots from a small set of available ...
Gaul, Constantin, Kurz, Sascha, Rambau, Joerg   +2 more
core   +2 more sources

Variable neighborhood search: basics and variants

EURO Journal on Computational Optimization, 2017
Variable neighborhood search (VNS) is a framework for building heuristics, based upon systematic changes of neighborhoods both in a descent phase, to find a local minimum, and in a perturbation phase to escape from the corresponding valley. In this paper,
Pierre Hansen, Nenad Mladenović, Raca Todosijević, Saïd Hanafi   +3 more
doaj  

Electric Vehicle Routing Problem: A Review of Recent Approaches and Algorithms

Studia Universitatis Babes-Bolyai: Series Informatica
With the rapid advancement of new energy vehicles, electric vehicles (EVs) have become integral to modern transportation systems. Compared with traditional fuel vehicles, EVs are limited by their limited battery capacity and require reasonable charging ...
Yingkai XU
doaj   +1 more source

A unified matheuristic for solving multi-constrained traveling salesman problems with profits

EURO Journal on Computational Optimization, 2017
In this paper, we address a rich Traveling Salesman Problem with Profits encountered in several real-life cases. We propose a unified solution approach based on variable neighborhood search.
Rahma Lahyani, Mahdi Khemakhem, Frédéric Semet   +2 more
doaj  

Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes [PDF]

, 2014
The von Neumann-Halperin method of alternating projections converges strongly to the projection of a given point onto the intersection of finitely many closed affine subspaces.
Pang, C. H. Jeffrey
core