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 38 items.
- 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)
- 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)
- Algorithms for the non-bifurcated network design problem (Q2271128) (← 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)
- Optimal solution of the discrete cost multicommodity network design problem (Q2518654) (← links)
- The single-node dynamic service scheduling and dispatching problem (Q2572807) (← links)
- Multiple Routing Strategies in a Labelled Network (Q2765602) (← links)
- (Q4266755) (← links)
- Strongly polynomial algorithm for two special minimum concave cost network flow problems (Q4764587) (← links)
- The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles (Q5385861) (← links)
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité (Q5479860) (← links)
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design (Q5946817) (← links)