On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem

DOI10.1002/NET.20255MaRDI QIDQ5191123zbMATH OpenOpenAlexFDO

Authors Mark W. Lewis

Publication date 28 July 2009

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20255

zbMATH Keywords

experimental designmulticommodity flow problemsnetwork design

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Stochastic network models in operations research (90B15)

Recommendations

• MIP neighborhood search heuristics for a capacitated fixed-charge network design problem
• Scatter search for network design problem
• A dual ascent approach to the fixed-charge capacitated network design problem
• A scatter search heuristic for the fixed-charge capacitated network design problem
• A cutting-plane neighborhood structure for fixed-charge capacitated multicommodity network design problem

Cites work

• A Computational Study of Search Strategies for Mixed Integer Programming
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
• An Analysis for Unreplicated Fractional Factorials
• Designing and reporting on computational experiments with heuristic methods
• Factor Screening in Simulation: Evaluation of Two Strategies Based on Random Balance Sampling
• Generalized networks: the theory of preprocessing and an empirical analysis
• Guided design search in the interval-bounded sailor assignment problem
• Locating Minimal Infeasible Constraint Sets in Linear Programs
• Network flows. Theory, algorithms, and applications.
• Operations Research and Capacity Expansion Problems: A Survey
• Optimization of Internet Protocol network design and routing
• Random sampling in cut, flow, and network design problems
• Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
• The path restoration version of the spare capacity allocation problem with modularity restrictions: models, algorithms, and an empirical analysis
• Using \(xQx\) to model and solve the uncapacitated task allocation problem

Cited in

(4)

• Fixed charge multicommodity network design using p-partition facets
• Guided design search in the interval-bounded sailor assignment problem
• Exact solutions to generalized vertex covering problems: a comparison of two models
• Avoiding unnecessary demerging and remerging of multi‐commodity integer flows

This page was built for publication: On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem

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