01075cam2 2200289 450 E60020003678820240530133157.020080502d1978 |||||ita|0103 baitaIT<<12: >>Indici dell'opera aggiornata al 31 dicembre 1977a cura di Vittorio Sgroi, Mario Stella Richter2 ed.MilanoGiuffrè1978296 p.24 cm001SOBE000804662000 Raccolta generale di legislazione / Carlo Alberto Funaioli, Maria Stella RichterFunaioli, Carlo AlbertoAF00013153070Stella Richter, MarioAF00017897070*ItaliaAF00024563070423419ITUNISOB20240530RICAUNISOBUNISOB340125540E600200036788M 102 Monografia moderna SBNM340006483Si125540donopomicinoUNISOBUNISOB20080502100228.020240530133157.0rovitoIndici dell'opera aggiornata al 31 dicembre 19774158686UNISOB03770nam 22007335 450 991048412250332120251226202147.03-642-36694-510.1007/978-3-642-36694-9(CKB)3280000000007554(DE-He213)978-3-642-36694-9(SSID)ssj0000880020(PQKBManifestationID)11466214(PQKBTitleCode)TC0000880020(PQKBWorkID)10853299(PQKB)10881269(MiAaPQ)EBC3093373(PPN)169139549(EXLCZ)99328000000000755420130321d2013 u| 0engurnn|008mamaatxtrdacontentcrdamediacrrdacarrierInteger Programming and Combinatorial Optimization 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings /edited by Michel Goemans, José Correa1st ed. 2013.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2013.1 online resource (XII, 400 p. 32 illus.) Theoretical Computer Science and General Issues,2512-2029 ;7801International conference proceedings.3-642-36693-7 Includes bibliographical references and index.On the Structure of Reduced Kernel Lattice Bases -- Constant Integrality Gap LP formulations of Unsplittable Flow on a Path -- Content Placement via the Exponential Potential Function Method -- Blocking Optimal Arborescences -- Matroid and Knapsack Center Problems -- On Some Generalizations of the Split Closure -- An Improved Integrality Gap for Asymmetric TSP Paths -- Two Dimensional Optimal Mechanism Design for a Sequencing Problem -- The Euclidean k-Supplier Problem.This book constitutes the proceedings of the 16th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2013, held in Valparaíso, Chile, in March 2013. The 33 full papers presented were carefully reviewed and selected from 98 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization with the aim to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.Theoretical Computer Science and General Issues,2512-2029 ;7801Numerical analysisAlgorithmsComputer scienceMathematicsDiscrete mathematicsComputer scienceNumerical AnalysisAlgorithmsDiscrete Mathematics in Computer ScienceComputer ScienceNumerical analysis.Algorithms.Computer scienceMathematics.Discrete mathematics.Computer science.Numerical Analysis.Algorithms.Discrete Mathematics in Computer Science.Computer Science.519.77Goemans Micheledthttp://id.loc.gov/vocabulary/relators/edtCorrea Joséedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK9910484122503321Integer Programming and Combinatorial Optimization2860150UNINA