Results 31 to 40 of about 143 (125)

Optimal capacitated ring trees

EURO Journal on Computational Optimization, 2016
We study a new network design model combining ring and tree structures under capacity constraints. The solution topology of this capacitated ring tree problem (CRTP) is based on ring trees which are the union of trees and 1-trees.
Alessandro Hill, Stefan Voß
doaj   +1 more source

Matching ontologies with kernel principle component analysis and evolutionary algorithm

Demonstratio Mathematica
Ontology serves as a structured knowledge representation that models domain-specific concepts, properties, and relationships. Ontology matching (OM) aims to identify similar entities across distinct ontologies, which is essential for enabling ...
Xue Xingsi, Ye Miao, Nian Qifeng
doaj   +1 more source

Intersection cuts from multiple rows: a disjunctive programming approach

EURO Journal on Computational Optimization, 2013
We address the issue of generating cutting planes for mixed integer programs from multiple rows of the simplex tableau with the tools of disjunctive programming.
Egon Balas, Andrea Qualizza
doaj   +1 more source

New neighborhood structures for the Double Traveling Salesman Problem with Multiple Stacks

, 2009
Traveling Salesman Problem, Metaheuristics, Neighborhood structures, Precedence constraints, LIFO loading, 90C27,
G. Tirado, A. Felipe, Ortuño Sánchez, María Teresa, Felipe Ortega, Ángel, M. Ortuño, Tirado Domínguez, Gregorio   +5 more
core   +1 more source

Automatic boomerang attacks search on Rijndael

Journal of Mathematical Cryptology
Boomerang attacks were introduced in 1999 by Wagner (The boomerang attack. In: Knudsen LR, editor. FSE’99. vol. 1636 of LNCS. Heidelberg: Springer; 1999. p.
Rouquette Loïc, Minier Marine, Solnon Christine   +2 more
doaj   +1 more source

Consensus of partitions : a constructive approach

, 2011
Partitions, Consensus, Transfer distance, Simulation, 68R05, 90C27, 68W25,
Alain Guénoche, Guénoche, Alain
core   +1 more source

Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem

EURO Journal on Computational Optimization, 2017
The generalized directed rural postman problem is an arc routing problem with many interesting real-life applications, such as routing for meter reading. In this application, a vehicle with a receiver travels through a series of neighborhoods.
Thais Ávila, Ángel Corberán, Isaac Plana, José M. Sanchis   +3 more
doaj   +1 more source

Solving large set covering problems for crew scheduling

, 1997
Crew scheduling, lagrangian relaxation, set-covering, optimization, 90C27,
PEZZELLA, Ferdinando, FAGGIOLI E., Enrico Faggioli, Ferdinando Pezzella   +3 more
core   +1 more source

THE GROTHENDIECK CONSTANT IS STRICTLY SMALLER THAN KRIVINE’S BOUND

Forum of Mathematics, Pi, 2013
The (real) Grothendieck constant ${K}_{G} $ is the infimum over those $K\in (0, \infty )$ such that for every $m, n\in \mathbb{N} $ and every $m\times n$ real matrix $({a}_{ij} )$ we have $$\begin{eqnarray*}\displaystyle \max _{\{ x_{i}\} _{i= 1}^{m} , \{
MARK BRAVERMAN, KONSTANTIN MAKARYCHEV, YURY MAKARYCHEV, ASSAF NAOR   +3 more
doaj   +1 more source

Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective

EURO Journal on Computational Optimization, 2018
Many practical combinatorial optimization problems can be described by integer linear programs having an exponential number of variables, and they are efficiently solved by column generation algorithms.
Christian Artigues, Nicolas Jozefowiez, BoaduM. Sarpong   +2 more
doaj   +1 more source