Exact sequential choice of locations in a network

DOI10.1023/A:1018950617642MaRDI QIDQ1290143zbMATH OpenOpenAlexFDO

Authors Jean-Michel Thizy, Geraldo Robson Mateus

Publication date 10 June 1999

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1018950617642

zbMATH Keywords

Lagrangian relaxationlarge network location problemssupermodularity

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 4010185
• On the exact solution of large-scale simple plant location problems
• scientific article; zbMATH DE number 3885614
• A method for solving to optimality uncapacitated location problems
• Solving nonlinear multiple-facility network location problems

Cited in

(3)

• Developing concurrent investment plans for power generation and transmission
• Sequential Location Game on Continuous Directional Star Networks
• Benders decomposition for the uncapacitated multiple allocation hub location problem

This page was built for publication: Exact sequential choice of locations in a network

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