scientific article; zbMATH DE number 1187079

MaRDI QIDQ3840281zbMATH OpenFDO

Authors Kaj Holmberg, Di Yuan

Publication date 10 August 1998

zbMATH Keywords

branch-and-boundcapacitated network designLagrangean heuristicmulticommodity minimal cost network flowsubgradient optimization

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1264406
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
• A branch-and-cut algorithm for capacitated network design problems
• A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
• A local branching heuristic for the capacitated fixed-charge network design problem
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
• A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem
• MIP neighborhood search heuristics for a capacitated fixed-charge network design problem
• A scatter search heuristic for the fixed-charge capacitated network design problem

Cited in

(12)

• A local branching heuristic for the capacitated fixed-charge network design problem
• A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
• Planning models for long-haul operations of postal and express shipment companies
• A branch-and-cut algorithm for capacitated network design problems
• Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
• scientific article; zbMATH DE number 1264406 (Why is no real title available?)
• scientific article; zbMATH DE number 1947445 (Why is no real title available?)
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem
• Principles and Practice of Constraint Programming – CP 2004
• A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design

This page was built for publication:

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