Pages that link to "Item:Q1926688"
From MaRDI portal
The following pages link to General network design: a unified view of combined location and network design problems (Q1926688):
Displayed 41 items.
- Optimizing budget allocation for center and median points (Q265070) (← links)
- A reliable budget-constrained FL/ND problem with unreliable facilities (Q291688) (← links)
- Heuristic algorithms for solving an integrated dynamic center facility location -- network design model (Q301077) (← links)
- Optimal wholesale facilities location within the fruit and vegetables supply chain with bimodal transportation options: an LP-MIP heuristic approach (Q319433) (← links)
- Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
- Rapid transit network design for optimal cost and origin-destination demand capture (Q336685) (← links)
- Scatter search for an uncapacitated \(p\)-hub median problem (Q337508) (← links)
- A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
- A Lagrangian relaxation approach for expansion of a highway network (Q512983) (← links)
- Achieving full connectivity of sites in the multiperiod reserve network design problem (Q1652228) (← links)
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem (Q1652441) (← links)
- Combined column-and-row-generation for the optimal communication spanning tree problem (Q1652585) (← links)
- Robust gateway placement in wireless mesh networks (Q1652709) (← links)
- Extended formulation for hop constrained distribution network configuration problems (Q1681271) (← links)
- Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
- Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem (Q1725626) (← links)
- Median and covering location problems with interconnected facilities (Q1738812) (← links)
- Fiber cable network design in tree networks (Q1749517) (← links)
- Branch-and-price-and-cut for a service network design and hub location problem (Q1752143) (← links)
- A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances (Q1753405) (← links)
- Multi-level facility location problems (Q1754251) (← links)
- A combined facility location and network design problem with multi-type of capacitated links (Q1788754) (← links)
- A look at the past and present of optimization - an editorial (Q1926685) (← links)
- Exact approaches for the minimum subgraph diameter problem (Q2108148) (← links)
- Sustainable capacitated facility location/network design problem: a non-dominated sorting genetic algorithm based multiobjective approach (Q2150757) (← links)
- A voltage drop limited decentralized electric power distribution network (Q2185525) (← links)
- Strategyproof auction mechanisms for network procurement (Q2215560) (← links)
- Majority spanning trees, cotrees and their applications (Q2232225) (← links)
- Location of speed-up subnetworks (Q2259045) (← links)
- On carriers collaboration in hub location problems (Q2286966) (← links)
- Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints (Q2294760) (← links)
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064) (← links)
- A competitive hub location and pricing problem (Q2356192) (← links)
- Towards optimizing the deployment of optical access networks (Q2513732) (← links)
- A capacitated hub location problem in freight logistics multimodal networks (Q2629899) (← links)
- Optimizing access to drinking water in remote areas. Application to Nepal (Q2669783) (← links)
- Hub Location as the Minimization of a Supermodular Set Function (Q2935299) (← links)
- (Q5051496) (← links)
- An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs (Q5106386) (← links)
- New Valid Inequalities for the Optimal Communication Spanning Tree Problem (Q5138258) (← links)
- Allocating nodes to hubs for minimizing the hubs processing resources: A case study (Q5242266) (← links)