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: 6th International IPCO Conference Houston, Texas, June 22-24, 1998 Proceedings
  name:
    name part: Bixby, Robert E.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Boyd, Andrew E.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Rios-Mercado, Roger Z.
    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: 1998
    edition: 1st ed. 1998.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: IX, 435 p. 55 illus., 18 illus. in color. online resource.
  table of contents: 0,1 Matrices, Matroids -- The Packing Property -- A Characterization of Weakly Bipartite Graphs -- Bipartite Designs -- Characterizing Noninteger Polyhedra with 0-1 Constraints -- A Theorem of Truemper -- The Generalized Stable Set Problem for Claw-Free Bidirected Graphs -- On a Min-max Theorem of Cacti -- Edge Connectivity -- Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs -- A New Bound for the 2-Edge Connected Subgraph Problem -- An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs -- Algorithms -- Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width -- Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs -- Approximation Algorithms for the Mixed Postman Problem -- Improved Approximation Algorithms for Uncapacitated Facility Location -- The Maximum Traveling Salesman Problem Under Polyhedral Norms -- Integer Programming Applications -- Polyhedral Combinatorics of Benzenoid Problems -- Consecutive Ones and a Betweenness Problem in Computational Biology -- Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables -- Integer Programming Computation -- The Intersection of Knapsack Polyhedra and Extensions -- New Classes of Lower Bounds for Bin Packing Problems -- Solving Integer and Disjunctive Programs by Lift and Project -- A Class of Hard Small 0-1 Programs -- Network Flows -- Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time -- Simple Generalized Maximum Flow Algorithms -- The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem -- An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow -- Scheduling -- Non-approximability Results for Scheduling Problems with Minsum Criteria -- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems -- An Efficient App…
  note: edited by Robert E. Bixby, Andrew E. Boyd, Roger Z. Rios-Mercado.
  subject:
    topic: Algorithms
  subject:
    topic: Computer science-Mathematics
  subject:
    topic: Calculus of variations
  subject:
    topic: Combinatorics
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Calculus of Variations and Optimal Control; Optimization
  subject:
    topic: Combinatorics
  classification: QA76.9.A43
  classification: 005.1
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 1412
  identifier: 9783540693468
  identifier: https://doi.org/10.1007/3-540-69346-7
  record info:
    record creation date: 121227
    record change date: 20191026201317.0
    record identifier: 978-3-540-69346-8