Pages that link to "Item:Q3818783"
From MaRDI portal
The following pages link to Networks synthesis and optimum network design problems: Models, solution methods and applications (Q3818783):
Displayed 50 items.
- A distributionally robust joint chance constrained optimization model for the dynamic network design problem under demand uncertainty (Q291667) (← links)
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem (Q323161) (← links)
- A continuous bi-level model for the expansion of highway networks (Q336804) (← links)
- On discrete optimization with ordering (Q367635) (← links)
- Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
- Robust optimization model for a dynamic network design problem under demand uncertainty (Q542103) (← links)
- Benders, metric and cutset inequalities for multicommodity capacitated network design (Q632387) (← links)
- Approximating some network design problems with node costs (Q638508) (← links)
- Solving railroad blocking problem using ant colony optimization algorithm (Q651763) (← links)
- A hybrid algorithm for large-scale service network design considering a heterogeneous fleet (Q666955) (← links)
- Models for planning capacity expansion in local access telecommunication networks (Q806810) (← links)
- Routing of uncertain traffic demands (Q833385) (← links)
- A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs (Q850283) (← links)
- A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem (Q1014998) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- Reduction techniques for the PNS problems: a novel technique and a review (Q1041383) (← links)
- Finding minimum cost directed trees with demands and capacities (Q1179742) (← links)
- A dual ascent approach to the fixed-charge capacitated network design problem (Q1278408) (← links)
- Optimal lines for railway systems (Q1278454) (← links)
- Planning models for freight transportation (Q1278638) (← links)
- A capacity allocation problem with integer side constraints (Q1296707) (← links)
- Exact solution of multicommodity network optimization problems with general step cost functions (Q1306346) (← links)
- Algorithms for a multi-level network optimization problem (Q1307817) (← links)
- Hardware configuration for StarLAN 10 local area networks: An application of integer programming (Q1319553) (← links)
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem (Q1341992) (← links)
- Some thoughts on combinatorial optimisation (Q1388818) (← links)
- Service network design in freight transportation (Q1582187) (← links)
- A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem'' (Q1600948) (← links)
- Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
- A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759) (← links)
- A tabu search algorithm for the routing and capacity assignment problem in computer networks (Q1781553) (← links)
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs (Q1804581) (← links)
- Diversification strategies in local search for a nonbifurcated network loading problem (Q1848356) (← links)
- Integrating reliability and quality of service in networks with switched virtual circuits (Q1886726) (← links)
- Cost-optimal topology planning of hierarchical access networks (Q1886727) (← links)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- Global optimization of multilevel electricity market models including network design and graph partitioning (Q2010915) (← links)
- Reliability considerations for process network synthesis problems (Q2051174) (← links)
- Generalized hose uncertainty in single-commodity robust network design (Q2182776) (← links)
- Algorithms for the non-bifurcated network design problem (Q2271128) (← links)
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
- On the chance-constrained minimum spanning \(k\)-core problem (Q2274857) (← links)
- A fuzzy railroad blocking model with genetic algorithm solution approach for Iranian railways (Q2285316) (← links)
- Dynamic network design problem under demand uncertainty: an adjustable robust optimization approach (Q2321493) (← links)
- Maximum flow under proportional delay constraint (Q2402261) (← links)
- Survivable network design under optimal and heuristic interdiction scenarios (Q2460119) (← links)
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements (Q2468776) (← links)
- Network design and flow problems with cross-arc costs (Q2482771) (← links)
- A first multilevel cooperative algorithm for capacitated multicommodity network design (Q2489307) (← links)
- A constraint generation algorithm for large scale linear programs using multiple-points separation (Q2492707) (← links)