Integer Programming and Combinatorial Optimization (Record no. 95699)

000 -LEADER
fixed length control field 06071nam a22006255i 4500
001 - CONTROL NUMBER
control field 978-3-540-32102-6
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730195607.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 100715s2005 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540321026
-- 978-3-540-32102-6
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/b137143
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.M35
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA297.4
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYAM
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code PBD
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM014000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYAM
Source thema
072 #7 - SUBJECT CATEGORY CODE
Subject category code PBD
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.0151
Edition number 23
245 10 - TITLE STATEMENT
Title Integer Programming and Combinatorial Optimization
Medium [electronic resource] :
Remainder of title 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings /
Statement of responsibility, etc. edited by Michael Jünger, Volker Kaibel.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2005.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Berlin, Heidelberg :
Name of producer, publisher, distributor, manufacturer Springer Berlin Heidelberg :
-- Imprint: Springer,
Date of production, publication, distribution, manufacture, or copyright notice 2005.
300 ## - PHYSICAL DESCRIPTION
Extent XII, 488 p.
Other physical details online resource.
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
347 ## - DIGITAL FILE CHARACTERISTICS
File type text file
Encoding format PDF
Source rda
490 1# - SERIES STATEMENT
Series statement Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 3509
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Mixed-Integer Cuts from Cyclic Groups -- Optimizing over the First Chvàtal Closure -- Sequential Pairing of Mixed Integer Inequalities -- Approximate Min-max Relations for Odd Cycles in Planar Graphs -- Disjoint Cycles: Integrality Gap, Hardness, and Approximation -- A Combinatorial Algorithm to Find a Maximum Even Factor -- Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems -- On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem -- Inventory and Facility Location Models with Market Selection -- On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations -- Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials -- Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring -- On the Inefficiency of Equilibria in Congestion Games -- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times -- LP-Based Online Scheduling: From Single to Parallel Machines -- Unique Sink Orientations of Grids -- Jumping Doesn't Help in Abstract Cubes -- Computing the Inertia from Sign Patterns -- Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem -- On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem -- Smoothed Analysis of Integer Programming -- Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs -- Approximation Algorithms for Stochastic Inventory Control Models -- On Two-Stage Stochastic Minimum Spanning Trees -- Combinatorial Analysis of Generic Matrix Pencils -- Power Optimization for Connectivity Problems -- Packing Steiner Forests -- Bidimensional Packing by Bilinear Programming -- On the L???-Norm of Extreme Points for Crossing Supermodular Directed Network LPs -- Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks -- Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem -- Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems -- A Study of Domino-Parity and k-Parity Constraints for the TSP -- Not Every GTSP Facet Induces an STSP Facet.
520 ## - SUMMARY, ETC.
Summary, etc. Since its start in 1990, the IPCO conference series (held under the auspices of theMathematicalProgrammingSociety)hasbecomeanimportantforumforthe presentation of recent results in Integer Programming and Combinatorial Op- mization. This volume compiles the papers presented at IPCO XI, the eleventh conference in this series, held June 8-10, 2005, at the Technische Universit¨ at Berlin. The high interest in this conference series is evident in the large number of submissions. For IPCO XI, 119 extended abstracts of up to 10 pages were submitted. During its meeting on January 29-30, 2005, the Program Committee carefully selected 34 contributions for presentation in non-parallel sessions at the conference. The ?nal choices were not easy at all, since, due to the limited number of time slots, many very good papers could not be accepted. During the selection process the contributions were refereed according to the standards of refereed conferences. As a result of this procedure, you have in your hands a volume that contains papers describing high-quality research e?orts. The page limit for contributions to this proceedings volume was set to 15. You may ?nd full versions of the papers in scienti?c journals in the near future. We thank all the authors who submitted papers. Furthermore, the Program Committee is indebted to the many reviewers who, with their speci?c expertise, helped a lot in making the decisions.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer science
General subdivision Mathematics.
9 (RLIN) 3866
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Discrete mathematics.
9 (RLIN) 12873
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Numerical analysis.
9 (RLIN) 4603
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
9 (RLIN) 3390
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer graphics.
9 (RLIN) 4088
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Discrete Mathematics in Computer Science.
9 (RLIN) 31837
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Numerical Analysis.
9 (RLIN) 4603
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
9 (RLIN) 3390
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer Graphics.
9 (RLIN) 4088
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Jünger, Michael.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 160774
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Kaibel, Volker.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 160775
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
9 (RLIN) 160776
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783540261995
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783540811756
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 3509
9 (RLIN) 160777
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/b137143">https://doi.org/10.1007/b137143</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-Lecture Notes in CS

No items available.