On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem
From MaRDI portal
Publication:5191123
DOI10.1002/net.20255zbMath1176.90071OpenAlexW4252874314MaRDI QIDQ5191123
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
Stochastic network models in operations research (90B15) Deterministic network models in operations research (90B10)
Related Items (3)
Avoiding unnecessary demerging and remerging of multi‐commodity integer flows ⋮ Fixed charge multicommodity network design using \(p\)-partition facets ⋮ Exact solutions to generalized vertex covering problems: a comparison of two models
Cites Work
- Unnamed Item
- Designing and reporting on computational experiments with heuristic methods
- Using \(xQx\) to model and solve the uncapacitated task allocation problem
- Guided design search in the interval-bounded sailor assignment problem
- 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
- Generalized Networks: The Theory of Preprocessing and an Empirical Analysis
- A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
- Factor Screening in Simulation: Evaluation of Two Strategies Based on Random Balance Sampling
- An Analysis for Unreplicated Fractional Factorials
- Operations Research and Capacity Expansion Problems: A Survey
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- A Computational Study of Search Strategies for Mixed Integer Programming
- Optimization of Internet Protocol network design and routing
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
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
