Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 5-10 Tagen versandfertig
Veröffentlichung:	Mai 2016
Genre:	Schulbücher
	Algorithmen und Datenstrukturen / approximationalgorithms / combinatorialoptimization / ComputationalComplexity / computationalgeometry / cuttingplanes / diophantineequations / Diskrete Mathematik / EDV / Theorie / Programmieren / Allgemeines / geometryofnumbers / graphsandnetworks / integerprogramming / KnapsackProblem / LinearProgramming / Mathematik für Informatiker / matroids / Netzwerk-Hardware / NP-completeness / onlinealgorithms / polyhedralcombinatorics / Polynomialalgorithm / Randomizedalgorithms / Scheduling / Semidefiniteprograms / Submodularfunctions mehr...
ISBN:	9783319334608
EAN-Code:	9783319334608
Verlag:	Springer
Einband:	Kartoniert
Sprache:	English
Serie:	#9682 - Lecture Notes in Computer Science Theoretical Computer Science and General Issues
Dimensionen:	H 235 mm / B 155 mm / D 24 mm
Gewicht:	645 gr
Seiten:	428
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

This book constitutes the refereed proceedings of the 18th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2016, held in Liège, Belgium, in June 2016. The 33 full papers presented were carefully reviewed and selected from 125 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas. 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.