Jurado, Garcia Game theory 2011 - Universidad de Cádiz - Servicio de Publicaciones P. 45-47 Fa parte di Proceedings of OR Peripatetic Post-Graduate Programme (ORP3-2011) : Cádiz, Spain : September 13-17, 2011. - ( Actas) Capitoli dello stesso volume (disponibili singolarmente) Preface Ottieni capitolo Optimization on networks : facility location problems Ottieni capitolo An overview of discrete location Ottieni capitolo Routing problems Ottieni capitolo From local to global in numerical optimization Ottieni capitolo On some applications of combinatorial optimization Ottieni capitolo Bilevel programming and price optimization problems in transportation and production planning Ottieni capitolo Location problems in supply chain management Ottieni capitolo Game theory Optimizing dc functions : methods and applications Ottieni capitolo Vehicle routing for mixed solid waste collection comparing alternative hierarchical formulations Ottieni capitolo On the complexity and heuristic methods for a new arc routing problem Ottieni capitolo Cut-first branch-and-price-second for the capacitated arc-routing problem Ottieni capitolo An adaptive large neighborhood search for the pickup and delivery problem with transfers Ottieni capitolo Mail-delivery problems with park-and-loop tours : a heuristic approach Ottieni capitolo Affine recourse for the robust network design problem : between static and dynamic routing Ottieni capitolo Variants of shortest path problems Ottieni capitolo Fixed or variable demand? : does it matter when locating a facility? Ottieni capitolo Allocation and location space based branch and bound algorithms for the capacitated multi-facility Weber problem Ottieni capitolo Single-facility Huff location problems on networks : a DC approachs Ottieni capitolo On generating robust solutions of quadratically constrained bi-blending recipe designs Ottieni capitolo An improved semidefinite programming relaxation for max k-equipartitions Ottieni capitolo Multicriteria allocation problem Ottieni capitolo The three-dimensional knapsack problem with balancing constraints Ottieni capitolo Characterization of facets of the hop constrained chain polytope via Dynamic Programming Ottieni capitolo Nesting problems : mixed integer formulations and valid inequalities Ottieni capitolo Robust partitioning for stochastic multi-vehicle routing Ottieni capitolo Solving multi-objective traffic assignment Ottieni capitolo Heuristics for a stochastic and dynamic routing problem in industrial shipping Ottieni capitolo Robust UAV mission planning Ottieni capitolo Convexity and the Shapley value in Bertrand oligopoly TU-games Ottieni capitolo A stochastic R&D competition where winner takes all. Ottieni capitolo Ranking asymmetric auctions Ottieni capitolo A lagrangean heuristic for a nonlinear minsum facility location problem Ottieni capitolo Semi-lagrangean approach for price discovery in markets with non-convexities Ottieni capitolo When is rounding allowed? : a new approach to integer nonlinear optimization Ottieni capitolo Conjugate duality of set-valued functions Ottieni capitolo A heuristic for the circle packing problem with a variety of containers Ottieni capitolo Approximate solving of large p-median problems Ottieni capitolo Integrating synchronization bus timetabling and single-depot single-type vehicle scheduling Ottieni capitolo Locating optimal timetables and vehicle schedules in a transit line Ottieni capitolo Solution algorithms for uncertain R||ƩCᵢ problem with interval processing times Ottieni capitolo Multistage stochastic programming in strategic telecommunication network plannings Ottieni capitolo Column generation in the Integral Simplex Method Ottieni capitolo A network pricing formulation for the revenue maximization of European Air Navigation service providers Ottieni capitolo A mixed 0–1 nonlinear approach for the collision avoidance in ATM : velocity changes through a time horizon Ottieni capitolo Index of authors Ottieni capitolo Mostra altro Informazioni ISBN: 9788498287431 Permalink: https://digital.casalini.it/4657496