The generalized fixed-charge network design problem

DOI10.1016/J.COR.2005.05.021MaRDI QIDQ856677zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 7 December 2006

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2005.05.021

zbMATH Keywords

branch-cut-and-pricegeneralized network designhierarchical networksfixed-charge network design

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Mixed integer programming (90C11) Communication networks in operations research (90B18)

Recommendations

• New models of the generalized fixed-charge network design problem
• LP extreme points and cuts for the fixed-charge network design problem
• Generalized network design problems.
• Generalized network design problems. Modeling and optimization.
• Model and heuristic for a generalized access network design problem

Cites work

• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
• A survey on Benders decomposition applied to fixed-charge network design problems
• An exact algorithm for IP column generation
• Generalized network design problems.
• LP extreme points and cuts for the fixed-charge network design problem
• Tailoring Benders decomposition for uncapacitated network design

Cited in

(16)

• A fast solution method for the time-dependent orienteering problem
• On two new formulations for the fixed charge network design problem with shortest path constraints
• The orienteering problem: a survey
• A two-stage approach to the orienteering problem with stochastic weights
• scientific article; zbMATH DE number 409471 (Why is no real title available?)
• Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
• Valid inequalities and separation for uncapacitated fixed charge networks
• An improved hybrid ant-local search algorithm for the partition graph coloring problem
• LP extreme points and cuts for the fixed-charge network design problem
• Generalized network design problems.
• The complexity of the timetable‐based railway network design problem
• A hub location problem with fully interconnected backbone and access networks
• New models of the generalized fixed-charge network design problem
• Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks
• Exact approaches for network design problems with relays
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure

This page was built for publication: The generalized fixed-charge network design problem

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