Lower planes for the network design problem

DOI10.1002/NET.3230130309MaRDI QIDQ3037174zbMATH OpenOpenAlexFDO

Authors

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

linear lower approximations of the objective functionlower planesnetwork design problemrelaxations

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• Quadratic knapsack problems

Cited in

(5)

• 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
• A decomposition method for the min concave cost flow problem with a staircase structure
• Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3037174)