Integer Programming and Combinatorial Optimization (Record no. 183304)

MARC details
000 -LEADER
fixed length control field 05514nam a22006135i 4500
001 - CONTROL NUMBER
control field 978-3-319-59250-3
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240423125934.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 170523s2017 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783319592503
-- 978-3-319-59250-3
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-319-59250-3
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA297-299.4
072 #7 - SUBJECT CATEGORY CODE
Subject category code PBKS
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code MAT041000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code PBKS
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 518
Edition number 23
245 10 - TITLE STATEMENT
Title Integer Programming and Combinatorial Optimization
Medium [electronic resource] :
Remainder of title 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings /
Statement of responsibility, etc edited by Friedrich Eisenbrand, Jochen Koenemann.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2017.
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2017.
300 ## - PHYSICAL DESCRIPTION
Extent XI, 456 p. 34 illus.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
490 1# - SERIES STATEMENT
Series statement Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume number/sequential designation 10328
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note The Two-point Fano and Ideal Binary Clutters -- On Scheduling Coflows -- Integrality Gaps of Integer Knapsack Problems -- An Improved Integrality Gap for the Calinescu-Karloff-Rabani Relaxation for Multiway Cut -- Approximation of Corner Polyhedra with Families of Intersection Cuts -- The Structure of the Infinite Models in Integer Programming -- Mixed-integer Linear Representability, Disjunctions, and Variable Elimination -- Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time -- Cutting Planes from Wide Split Disjunctions -- The Salesman's Improved Tours for Fundamental Classes -- The Heterogeneous Capacitated k-Center Problem -- Local Guarantees in Graph Cuts and Clustering -- Verifying Integer Programming Results -- Long term Behavior of Dynamic Equilibria in uid Queuing Networks -- A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem -- Minimizing Multimodular Functions and Allocating Capacity in Bike-sharing Systems -- Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing -- Discrete Newton's Algorithm for Parametric Submodular Function Minimization -- Stochastic Online Scheduling on Unrelated Machines -- Online Matroid Intersection: Beating Half for Random Arrival -- Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector -- An Improved Deterministic Rescaling for Linear Programming Algorithms -- Min-Max Theorems for Packing and Covering Odd (u; v)-trails -- Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization -- A Quasi-Polynomial Approximation for the Restricted Assignment Problem -- Adaptive Submodular Ranking -- On the Notions of Facets, Weak Facets, and Extreme Functions of the Gomory-Johnson Infinite Group Problem -- Minimum Birkhoff-von Neumann Decomposition -- Maximum Matching in the Online Batch-Arrival Model -- Budget Feasible Mechanisms on Matroids -- Deterministic Discrepancy Minimization Via the Multiplicative Weight Update Method -- Mixed-integerConvex Representability -- High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and Chvatal-Gomory Cuts -- Enumeration of Integer Points in Projections of Unbounded Polyhedral -- Excluded t-factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-matchings -- Equilibrium Computation in Atomic Splittable Singleton Congestion Games. .
520 ## - SUMMARY, ETC.
Summary, etc This book constitutes the refereed proceedings of the 19th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2017, held in Waterloo, IN, Canada, in June 2017. The 36 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--TOPICAL TERM
Topical term or geographic name as entry element Numerical analysis.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science
General subdivision Mathematics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete mathematics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer networks .
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Artificial intelligence.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Numerical Analysis.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Communication Networks.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Artificial Intelligence.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Eisenbrand, Friedrich.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Koenemann, Jochen.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783319592497
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783319592510
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Theoretical Computer Science and General Issues,
-- 2512-2029 ;
Volume number/sequential designation 10328
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/978-3-319-59250-3">https://doi.org/10.1007/978-3-319-59250-3</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-CSE-Springer

No items available.

© 2024 IIIT-Delhi, library@iiitd.ac.in