rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Integer Programming and Combinatorial Optimization
    sub title: 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001. Proceedings
  name:
    name part: Aardal, Karen.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Gerards, Bert.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2001
    edition: 1st ed. 2001.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XII, 428 p. online resource.
  abstract: This volume contains the papers selected for presentation at IPCO VIII, the Eighth Conference on Integer Programming and Combinatorial Optimization, Utrecht, The Netherlands, 2001. This meeting isa forum for researchers and practitioners working on various aspects of integer programming and combi- torial optimization. The aim is to present recent developments in theory, com- tation, and application of integer programming and combinatorial optimization. Topics include, but are not limited to: approximation algorithms, branch and bound algorithms, computational biology, computational complexity, compu- tional geometry, cutting plane algorithms, diophantine equations, geometry of numbers, graph and network algorithms, integer programming, matroids and submodular functions, on-line algorithms, polyhedral combinatorics, scheduling theory and algorithms, and semide nit e programs. IPCO was established in 1988 when the rs t IPCO program committee was formed. The locations and years of the seven rs t IPCO conferences were: IPCO I, Waterloo (Canada) 1990, IPCO II, Pittsburgh (USA) 1992, IPCO III, - ice (Italy) 1993, IPCO IV, Copenhagen (Denmark) 1995, IPCO V, Vancouver (Canada) 1996, IPCO VI, Houston (USA) 1998, IPCO VII, Graz (Austria) 1999. IPCO is held every year in which no MPS (Mathematical Programming Society) International Symposium takes place. Since the MPS meeting is triennial, IPCO conferences are held twice in every three-year period. Asa rule, IPCO is held somewhere in Northern America in even years, and somewhere in Europe in odd years.
  table of contents: Two O(log* k)-Approximation Algorithms for the Asymmetric k-Center Problem -- Strongly Polynomial Algorithms for the Unsplittable Flow Problem -- Edge Covers of Setpairs and the Iterative Rounding Method -- The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates -- Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation -- On the Rank of Mixed 0,1 Polyhedra -- Fast 2-Variable Integer Programming -- Approximating k-Spanner Problems for k > 2 -- A Matroid Generalization of the Stable Matching Polytope -- A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity -- Combined Connectivity Augmentation and Orientation Problems -- An Extension of a Theorem of Henneberg and Laman -- Bisubmodular Function Minimization -- On the Integrality Gap of a Natural Formulation of the Single-sink Buy-at-Bulk Network Design Problem -- Circuit Mengerian Directed Graphs -- Integral Polyhedra Related to Even Cycle and Even Cut Matroids -- A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems -- Synthesis of 2-Commodity Flow Networks -- Bounds for Deterministic Periodic Routing sequences -- Cutting Planes for Mixed 0-1 Semidefinite Programs -- Independence Free Graphs and Vertex connectivity Augmentation -- The Throughput of Sequential Testing -- An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs -- Pruning by Isomorphism in Branch-and-Cut -- Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times -- Fences Are Futile: On Relaxations for the Linear Ordering Problem -- Generating Cuts from Multiple-Term Disjunctions -- A (2+?)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective -- Performance Guarantees of Local Search for Multiprocessor Scheduling -- connected Joins in Graphs -- Two NP-hardness Results for Preemptive Minsum Scheduling …
  note: edited by Karen Aardal, Bert Gerards.
  subject:
    topic: Probabilities
  subject:
    topic: Algorithms
  subject:
    topic: Computer science-Mathematics
  subject:
    topic: Information technology
  subject:
    topic: Business-Data processing
  subject:
    topic: Combinatorics
  subject:
    topic: Probability Theory and Stochastic Processes
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: IT in Business
  subject:
    topic: Combinatorics
  classification: QA273.A1-274.9
  classification: QA274-274.9
  classification: 519.2
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 2081
  identifier: 9783540455356
  identifier: https://doi.org/10.1007/3-540-45535-3
  record info:
    record creation date: 121227
    record change date: 20191026032315.0
    record identifier: 978-3-540-45535-6