17 resultados para Fundamentals in linear algebra
Biased Random-key Genetic Algorithms For The Winner Determination Problem In Combinatorial Auctions.
Resumo:
Abstract In this paper, we address the problem of picking a subset of bids in a general combinatorial auction so as to maximize the overall profit using the first-price model. This winner determination problem assumes that a single bidding round is held to determine both the winners and prices to be paid. We introduce six variants of biased random-key genetic algorithms for this problem. Three of them use a novel initialization technique that makes use of solutions of intermediate linear programming relaxations of an exact mixed integer-linear programming model as initial chromosomes of the population. An experimental evaluation compares the effectiveness of the proposed algorithms with the standard mixed linear integer programming formulation, a specialized exact algorithm, and the best-performing heuristics proposed for this problem. The proposed algorithms are competitive and offer strong results, mainly for large-scale auctions.
Resumo:
Bettini et al (2006 Nat. Nanotechnol. 1 182-5) reported the first experimental realization of linear atomic chains (LACs) composed of different atoms (Au and Ag). The different contents of Au and Ag were observed in the chains from what was found in the bulk alloys, which raises the question of what the wire composition is, if it is in equilibrium with a bulk alloy. In this work we address the thermodynamic driving force for species fractionation in LACs under tension, and we present the density-functional theory results for Ag-Au chain alloys. A pronounced stabilization of the wires with an alternating Ag-Au sequence is observed, which could be behind the experimentally observed Au enrichment in LACs from alloys with high Ag content.