Integer Programming and Combinatorial Optimization (Record no. 55763)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 04956nam a22005415i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-319-33461-5 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20200421111845.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 160524s2016 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783319334615 |
| -- | 978-3-319-33461-5 |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 518 |
| 245 10 - TITLE STATEMENT | |
| Title | Integer Programming and Combinatorial Optimization |
| Sub Title | 18th International Conference, IPCO 2016, Li�ege, Belgium, June 1-3, 2016, Proceedings / |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | XIII, 412 p. 33 illus. |
| 490 1# - SERIES STATEMENT | |
| Series statement | Lecture Notes in Computer Science, |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Remark 2 | On Approximation Algorithms for Concave Mixed-Integer QuadraticProgramming -- Centerpoints: A link between optimization and convex geometry -- Rescaled coordinate descent methods for Linear Programming -- Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems -- Max-Cut under Graph Constraints -- Sparsest cut in planar graphs, maximum concurrent ows and their connections with the max-cut problem -- Intersection Cuts for Bilevel Optimization -- Exact Algorithms for the Chance-Constrained Vehicle Routing Problem -- Extended Formulations in Mixed-integer Convex Programming -- k-Trails: Recognition, Complexity, and Approximations -- Better s-t-Tours by Gao Trees -- Popular Edges and Dominant Matchings -- Semidefinite and linear programming integrality gaps for scheduling identical machines -- Stabilizing network bargaining games by blocking players -- Round Robin Tournaments Generated by the Circle Method have Maximum Carry-Over -- Extreme Functions with an Arbitrary Number of Slopes -- Minimal cut-generating functions are nearly extreme -- On the Mixed Binary Representability of Ellipsoidal Regions -- Constant Factor Approximation for ATSP with Two Edge Weights -- Improved Approximation Algorithms for Hitting 3-Vertex Paths -- Improved Approximations for Cubic Bipartite and Cubic TSP -- An approximation algorithm for Uniform Capacitated k-Median problem with 1 + ϵ capacity violation -- Valid Inequalities for Separable Concave Constraints with Indicator Variables -- A Polyhedral Approach to Online Bipartite Matching -- On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chv�atal Rank -- Robust Monotone Submodular Function Maximization -- Maximizing Monotone Submodular Functions over the Integer Lattice -- Submodular Unsplittable Flow on Trees -- Strong reductions for extended formulations -- Sum-of-squares lower bounds for maximally symmetric formulations -- Sum-of-squares lower bounds for maximally symmetric formulations -- Deciding Emptiness of the Gomory-Chv�atal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point -- On the quantile cut closure of chance-constrained problems. . |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | This book constitutes the refereed proceedings of the 18th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2016, held in Li�ege, 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. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| General subdivision | Mathematics. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Louveaux, Quentin. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Skutella, Martin. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/978-3-319-33461-5 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Cham : |
| -- | Springer International Publishing : |
| -- | Imprint: Springer, |
| -- | 2016. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer communication systems. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Numerical analysis. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science |
| 650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Numeric Computing. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Algorithm Analysis and Problem Complexity. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Discrete Mathematics in Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer Communication Networks. |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| -- | 0302-9743 ; |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 912 ## - | |
| -- | ZDB-2-LNC |
No items available.