15,069 research outputs found

    Cut and Column Generation

    Get PDF

    An Algorithmic Framework for Strategic Fair Division

    Full text link
    We study the paradigmatic fair division problem of allocating a divisible good among agents with heterogeneous preferences, commonly known as cake cutting. Classical cake cutting protocols are susceptible to manipulation. Do their strategic outcomes still guarantee fairness? To address this question we adopt a novel algorithmic approach, by designing a concrete computational framework for fair division---the class of Generalized Cut and Choose (GCC) protocols}---and reasoning about the game-theoretic properties of algorithms that operate in this model. The class of GCC protocols includes the most important discrete cake cutting protocols, and turns out to be compatible with the study of fair division among strategic agents. In particular, GCC protocols are guaranteed to have approximate subgame perfect Nash equilibria, or even exact equilibria if the protocol's tie-breaking rule is flexible. We further observe that the (approximate) equilibria of proportional GCC protocols---which guarantee each of the nn agents a 1/n1/n-fraction of the cake---must be (approximately) proportional. Finally, we design a protocol in this framework with the property that its Nash equilibrium allocations coincide with the set of (contiguous) envy-free allocations

    Revisiting the Evolution and Application of Assignment Problem: A Brief Overview

    Get PDF
    The assignment problem (AP) is incredibly challenging that can model many real-life problems. This paper provides a limited review of the recent developments that have appeared in the literature, meaning of assignment problem as well as solving techniques and will provide a review on   a lot of research studies on different types of assignment problem taking place in present day real life situation in order to capture the variations in different types of assignment techniques. Keywords: Assignment problem, Quadratic Assignment, Vehicle Routing, Exact Algorithm, Bound, Heuristic etc

    Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization

    No full text
    International audienceThe Cologne-Twente Workshop (CTW) on Graphs and Combinatorial Optimization started off as a series of workshops organized bi-annually by either Köln University or Twente University. As its importance grew over time, it re-centered its geographical focus by including northern Italy (CTW04 in Menaggio, on the lake Como and CTW08 in Gargnano, on the Garda lake). This year, CTW (in its eighth edition) will be staged in France for the first time: more precisely in the heart of Paris, at the Conservatoire National d’Arts et Métiers (CNAM), between 2nd and 4th June 2009, by a mixed organizing committee with members from LIX, Ecole Polytechnique and CEDRIC, CNAM

    Multi-Level Optimization Problems for Kidney Exchange

    Get PDF

    Algorithms for Large Orienteering Problems

    Get PDF
    In this thesis, we have developed algorithms to solve large-scale Orienteering Problems. The Orienteering Problem is a combinatorial optimization problem were given a weighted complete graph with vertex profits and a maximum distance constraint, the goal is to find the simple cycle which maximizes the sum of the profits of the visited vertices. To solve the Orienteering Problem, we have developed an evolutionary algorithm and an Branch-and-Cut algorithm. One of the key characteristics of the evolutionary algorithm is to work with unfeasible solutions. From the point of view of genetic operators, the main contribution has been the development of the Edge Recombination Crossover for the Orienteering Problem, which in a wider context it is also valid for any cycle problem. Another contribution has been the developed local search to handle large problems. The Branch-and-Cut algorithm includes new contributions in the separation algorithms of inequalities stemming from the cycle problem, in the separation loop, in the variables pricing, and in the calculation of the lower and upper bounds of the problem. At the same time, we have generalized for cycle problems the support graph shrinking techniques and procedures to speed up the exact separation algorithms for subcycle elimination constraints. The experiments carried out in large-sized instances, up to 7393 nodes, show that both algorithms achieve outstanding results, both in terms of the quality of solutions and in terms of the execution time.BERC.2014-2017 SEV-2013-0323 PID2019-104933GB-I00 MTM2015-65317-

    Algorithms for large orienteering problems

    Get PDF
    185 p.Tesi lan honetan, tamaina handiko Orientazio Problemak ebazteko algoritmoak garatu ditugu. Orientazio Problema optimizazio konbinatorioko problema bat da: herri multzo bat eta hauen arteko distantzia emanik, herri bakoitzak bere saria duelarik, eta ibilbidearen distantzia osoaren murrizketa bat ezarririk, problemaren helburua sarien batura maximizatzen duen ibilbidea aurkitzean datza. Orientazio Problema ebazteko, algoritmo ebolutibo bat eta Branch-and-Cut algoritmo bat garatu ditugu. Algoritmo ebolutiboaren ezaugarri nagusienetako bat, soluzio ez bideragarriekin lan egitea da. Eragile genetikoen ikuspuntutik algoritmo honen ekarpen nagusia Orientazio Problemarentzako proposatutako Ertzen Birkonbinazio Gurutzaketa da. Beste ekarpen bat problema handiak ebazteko aproposa den bilaketa lokala da. Branch-and-Cut algoritmoak berriz, ziklo problementzako banantze algoritmoetan, banantze begiztan, aldagaien baloratzean, eta problemaren goi eta behe-mugen kalkuluan ditu ekarpen nagusiak. Aldi berean, ziklo problementzako algoritmo zehatzaren parte diren euskarri grafoen sinplifikazio teknika eta azpizikloak identifikatzeko separazio algoritmoak aztertu ditugu. Tamaina handiko problemekin, 7393 herrirainokoak, egindako esperimentuek erakusten dute bi algoritmoek primerako emaitzak lortzen dituztela, bai soluzioen kalitatearen aldetik eta bai algoritmoen azkartasunaren aldetik ere.En esta tesis, hemos desarrollado algoritmos para resolver instancias de gran tamaño para el Problema de Orientación. El Problema de Orientación es un problema de optimización combinatoria en el cual, dado un grafo, con distancias asociadas en las aristas y premios en los vértices, y la restricción de longitud máxima de la ruta, el objetivo es maximizar la suma de recompensas de las ciudades visitadas.Para resolver el Problema de Orientación, hemos desarrollado un algoritmo evolutivo y un algoritmo Branch-and-Cut. La principal característica del algoritmo evolutivo es el uso de soluciones infactibles durante de la búsqueda. Desde el punto de vista de los operadores genéticos, la contribución más notable es el desarrollo del Cruce de Recombinación de Aristas para el Problema de Orientación. Otra contribución ha sido el desarrollo de una búsqueda local que permite abarcar problemas de gran tamaño. El algoritmo Branch-and-Cut incluye contribuciones en los algoritmos de separación para problemas de ciclos, en el bucle de separación, en la estimación de precios de las variables, y en el cálculo de las cotas inferiores y superiores del problema. Al mismo tiempo, generalizamos para problemas de ciclos, la contracción de grafos soporte y procedimientos para acelerar la separación exacta de las restricciones de eliminación de subciclos. Los experimentos llevados a cabo en problemas de gran tamaño, problemas de hasta 7393 nodos, muestran que ambos algoritmos obtienen resultados excelentes, en términos de la calidad de la solución y en términos del tiempo de ejecución.-In this thesis, we have developed algorithms to solve large-scale Orienteering Problems. The Orienteering Problem is a combinatorial optimization problem were given a weighted complete graph with vertex profits and a maximum distance constraint, the goal is to find the simple cycle which maximizes the sum of the profits of the visited vertices. To solve the Orienteering Problem, we have developed an evolutionary algorithm and a Branch-and-Cut algorithm. One of the key characteristics of the evolutionary algorithm is to work with unfeasible solutions. From the point of view of genetic operators, the main contribution has been the development of the Edge Recombination Crossover for the Orienteering Problem, which in a wider context it is also valid for any cycle problem. Another contribution has been the developed local search to handle large problems. The Branch-and-Cut algorithm includes new contributions in the separation algorithms of inequalities stemming from the cycle problem, in the separation loop, in the variables pricing, and in the calculation of the lower and upper bounds of the problem. At the same time, we have generalized for cycle problems the support graph shrinking techniques and procedures to speed up the exact separation algorithms for subcycle elimination constraints. The experiments carried out in large-sized instances, up to 7393 nodes, show that both algorithms achieve outstanding results, both in terms of the quality of solutions and in terms of the execution time.bcam:basque center for applied mathematic
    corecore