Lower planes for the network design problem

DOI10.1002/net.3230130309zbMath0523.90087OpenAlexW1986757220MaRDI QIDQ3037174

No author found.

Publication date: 1983

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230130309

zbMATH Keywords

network design problemrelaxationslinear lower approximations of the objective functionlower planes

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (5)

A decomposition method for the min concave cost flow problem with a staircase structure ⋮ A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure ⋮ A survey on Benders decomposition applied to fixed-charge network design problems ⋮ Lower bounding techniques for the degree-constrained network design problem ⋮ Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité

Cites Work

• Quadratic knapsack problems
• Unnamed Item

This page was built for publication: Lower planes for the network design problem