MARC 닫기

• LDR

  00861nam a2200241 c 4500

• 001

  000000507796

• 005

  20121002085237

• 008

  110523s2003 gw a 001a eng

• 020

  ▼a  3540443894

• 040

  ▼a  211047
  ▼c  211047

• 049

  ▼l  AZ0000264458
  ▼v  3

• 082

  ▼a  519.3
  ▼2  21

• 090

  ▼a  519.3
  ▼b  Sch7c
  ▼c  3

• 245

  ▼a  Combinatorial optimization:
  ▼b  polyhedra and efficiency.
  ▼n  C:
  ▼p  Disjoint paths, hypergraphs/
  ▼d  Alexander Schrijver.

• 260

  ▼a  Berlin:
  ▼b  Springer,
  ▼c  2003.

• 300

  ▼a  xxxiii, [664]p.:
  ▼b  ill.;
  ▼c  24cm.

• 440

  ▼a  Algorithms and combinatorics;
  ▼v  24

• 500

  ▼a  Includes bibliographical references and index

• 653

  ▼a  COMBINATORIAL
  ▼a  OPTIMIZATION
  ▼a  POLYHEDRA
  ▼a  EFFICIENCY
  ▼a  DISJOINT
  ▼a  PATHS
  ▼a  HYPERGRAPHS
  ▼a  ALGORITHMS
  ▼a  COMBINATORICS

• 700

  ▼a  Schrijver, Alexander,

• 740

  ▼a  Polyhedra and efficiency

• 950

  ▼b  EUR84.95

• 990

  ▼a  211047,김영미

• 991

  ▼a  단행본

• 090

  ▼a  519.3
  ▼b  Sch7c