How Can Specialized Discrete and Convex Optimization Methods Be Married?

This publication has 19 references indexed in Scilit:

• Optimal expansion of an existing network
  Mathematical Programming, 1974
• Lagrangean relaxation for integer programming
  Published by Springer Nature ,1974
• Optimal Network Problem: A Branch-and-Bound Algorithm
  Environment and Planning A: Economy and Space, 1973
• A unified algorithm for designing multidrop teleprocessing networks
  Published by Association for Computing Machinery (ACM) ,1973
• The flow deviation method: An approach to store‐and‐forward communication network design
  Networks, 1973
• Generalized Benders decomposition
  Journal of Optimization Theory and Applications, 1972
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
  SIAM Review, 1971
• Elements of Large-Scale Mathematical Programming Part I: Concepts
  Management Science, 1970
• Review of sequencing research
  Naval Research Logistics Quarterly, 1970
• The machine sequencing problem – review and extensions
  Naval Research Logistics Quarterly, 1968