Models and algorithms for network design problems

DOI10.1007/s10288-011-0174-8zbMath1362.90124OpenAlexW1979148185MaRDI QIDQ1936663

Michael Poss

Publication date: 6 February 2013

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/209968/1/80aac292-e7ca-441e-a3c9-23a60cb966f2.txt

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Stochastic programming (90C15) Deterministic network models in operations research (90B10)

Related Items (1)

Network design in scarce data environment using moment-based distributionally robust optimization

This page was built for publication: Models and algorithms for network design problems