Network Design

 

 
• Spanning Trees
  • ND1 M INIMUM K -S PANNING T REE
  • ND2 M INIMUM D EGREE S PANNING T REE
  • ND3 M INIMUM G EOMETRIC 3-D EGREE S PANNING T REE
  • ND4 M AXIMUM L EAF S PANNING T REE
  • ND5 M AXIMUM M INIMUM M ETRIC K -S PANNING T REE
  • ND6 M INIMUM D IAMETER S PANNING S UBGRAPH
  • ND7 M INIMUM S TEINER T REE
  • ND8 M INIMUM G EOMETRIC S TEINER T REE
  • ND9 M INIMUM G ENERALIZED S TEINER N ETWORK
  • ND10 M INIMUM R OUTING T REE C ONGESTION
• Cuts and Connectivity
  • ND11 M AXIMUM C UT
  • ND12 M INIMUM C ROSSING N UMBER
  • ND13 M AXIMUM D IRECTED C UT
  • ND14 M AXIMUM K -C UT
  • ND15 M INIMUM N ETWORK I NHIBITION ON P LANAR G RAPHS
  • ND16 M INIMUM K -C UT
  • ND17 M INIMUM V ERTEX K -C UT
  • ND18 M INIMUM M ULTIWAY C UT
  • ND19 M INIMUM M ULTI -C UT
  • ND20 M INIMUM R ATIO -C UT
  • ND21 M INIMUM B -B ALANCED C UT
  • ND22 M INIMUM B -V ERTEX S EPARATOR
  • ND23 M INIMUM Q UOTIENT C UT
  • ND24 M INIMUM K -V ERTEX C ONNECTED S UBGRAPH
  • ND25 M INIMUM K -E DGE C ONNECTED S UBGRAPH
  • ND26 M INIMUM B ICONNECTIVITY A UGMENTATION
  • ND27 M INIMUM S TRONG C ONNECTIVITY A UGMENTATION
  • ND28 M INIMUM B OUNDED D IAMETER A UGMENTATION
• Routing Problems
  • ND29 M INIMUM T RAVELING S ALESPERSON
  • ND30 M INIMUM M ETRIC T RAVELING S ALESPERSON P ROBLEM
  • ND31 M INIMUM G EOMETRIC T RAVELING S ALESPERSON
  • ND32 M INIMUM M ETRIC T RAVELING K -S ALESPERSON P ROBLEM
  • ND33 M INIMUM M ETRIC B OTTLENECK W ANDERING S ALESPERSON P ROBLEM
  • ND34 M INIMUM C HINESE P OSTMAN FOR M IXED G RAPHS
  • ND35 M INIMUM K -C HINESE P OSTMAN P ROBLEM
  • ND36 M INIMUM S TACKER C RANE P ROBLEM
  • ND37 M INIMUM K -S TACKER C RANE P ROBLEM
  • ND38 M INIMUM G ENERAL R OUTING
  • ND39 L ONGEST P ATH
  • ND40 S HORTEST W EIGHT -C ONSTRAINED P ATH
  • ND41 M INIMUM R ECTILINEAR G LOBAL R OUTING
• Flow Problems
  • ND42 M AXIMUM P RIORITY F LOW
  • ND43 M AXIMUM I NTEGRAL K -M ULTICOMMODITY F LOW ON T REES
  • ND44 M AXIMUM D ISJOINT C ONNECTING P ATHS
  • ND45 M INIMUM M AXIMUM D ISJOINT C ONNECTING P ATHS
  • ND46 M INIMUM S INGLE -S INK E DGE I NSTALLATION
• Miscellaneous
  • ND47 M INIMUM B ROADCAST T IME
  • ND48 M INIMUM K -C ENTER
  • ND49 M INIMUM K -C LUSTERING
  • ND50 M INIMUM K -C LUSTERING S UM
  • ND51 M INIMUM K -S UPPLIER
  • ND52 M INIMUM K -M EDIAN
  • ND53 M INIMUM D IAMETERS D ECOMPOSITION
  • ND54 M AXIMUM K -F ACILITY D ISPERSION
  • ND55 M AXIMUM K -F ACILITY L OCATION
  • ND56 M INIMUM K -S WITCHING N ETWORK
  • ND57 M INIMUM B END N UMBER
  • ND58 M INIMUM L ENGTH T RIANGULATION
  • ND59 M INIMUM S EPARATING S UBDIVISION