Results 21 to 30 of about 267 (48)
A feasibility approach for constructing combinatorial designs of circulant type [PDF]
, 2017 In this work, we propose an optimization approach for constructing various classes of circulant combinatorial designs that can be defined in terms of autocorrelations.
Artacho, Francisco J. Aragón +3 more
core +3 more sources
An ADMM-based heuristic algorithm for optimization problems over nonconvex second-order cone
Open Computer ScienceThe nonconvex second-order cone (nonconvex SOC) is a nonconvex extension to the convex second-order cone, in the sense that it consists of any vector divided into two sub-vectors for which the Euclidean norm of the first sub-vector is at least as large ...
Alzalg Baha, Benakkouche Lilia
doaj +1 more source
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
, 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 +33 more
core +1 more source
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
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 +2 more
core +2 more sources
Electric Vehicle Routing Problem: A Review of Recent Approaches and Algorithms
Studia Universitatis Babes-Bolyai: Series InformaticaWith 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
Construction of near-optimal vertex clique covering for real-world networks [PDF]
, 2015 We propose a method based on combining a constructive and a bounding heuristic to solve the vertex clique covering problem (CCP), where the aim is to partition the vertices of a graph into the smallest number of classes, which induce cliques.
Chalupa, David
core
Evolution Strategies in Optimization Problems [PDF]
, 2007 Evolution Strategies are inspired in biology and part of a larger research field known as Evolutionary Algorithms. Those strategies perform a random search in the space of admissible functions, aiming to optimize some given objective function.
Cruz, Pedro A. F., Torres, Delfim F. M.
core +3 more sources
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 +27 more
core +1 more source