Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 9682)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: IPCO 2016.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
Similar content being viewed by others
Keywords
- Approximation algorithms
- Combinatorial optimization
- Computational complexity
- Integer programming
- Linear programming
- Computational geometry
- Cutting planes
- Diophantine equations
- Geometry of numbers
- Graphs and networks
- Knapsack problem
- Matroids
- NP-completeness
- Online algorithms
- Polyhedral combinatorics
- Polynomial algorithm
- Randomized algorithms
- Scheduling
- Semidefinite programs
- Submodular functions
Table of contents (33 papers)
Other volumes
-
Integer Programming and Combinatorial Optimization
Editors and Affiliations
Bibliographic Information
Book Title: Integer Programming and Combinatorial Optimization
Book Subtitle: 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings
Editors: Quentin Louveaux, Martin Skutella
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-33461-5
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing Switzerland 2016
Softcover ISBN: 978-3-319-33460-8Published: 25 May 2016
eBook ISBN: 978-3-319-33461-5Published: 25 May 2016
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIII, 412
Number of Illustrations: 33 b/w illustrations
Topics: Numeric Computing, Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Computer Communication Networks