Exact sequential choice of locations in a network

DOI10.1023/A:1018950617642zbMATH Open0921.90105OpenAlexW97642255MaRDI QIDQ1290143FDOQ1290143

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

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

zbMATH Keywords

Lagrangian relaxationsupermodularitylarge network location problems

Mathematics Subject Classification ID

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

Cited In (3)

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

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)