Pages that link to "Item:Q1038109"

The following pages link to An improved Benders decomposition applied to a multi-layer network design problem (Q1038109):

Displaying 41 items.

• A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty (Q322691) (← links)
• A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks (Q323507) (← links)
• Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain (Q342011) (← links)
• On the hop-constrained survivable network design problem with reliable edges (Q342080) (← links)
• Unsplittable non-additive capacitated network design using set functions polyhedra (Q342169) (← links)
• Network design in scarce data environment using moment-based distributionally robust optimization (Q1651520) (← links)
• Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559) (← links)
• Network loading problem: valid inequalities from 5- and higher partitions (Q1654355) (← links)
• On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization (Q1686496) (← links)
• Fixed charge multicommodity network design using \(p\)-partition facets (Q1698889) (← links)
• A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation (Q1744909) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• Scheduling medical residents' training at university hospitals (Q1755256) (← links)
• Benders decomposition: solving binary master problems by enumeration (Q1785474) (← links)
• A new formulation and an exact approach for the many-to-many hub location-routing problem (Q1789047) (← links)
• Separating tight metric inequalities by bilevel programming (Q1939716) (← links)
• Accelerating Benders decomposition for short-term hydropower maintenance scheduling (Q2028814) (← links)
• Capacitated multi-period maximal covering location problem with server uncertainty (Q2029288) (← links)
• Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework (Q2029367) (← links)
• Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut (Q2030502) (← links)
• Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem (Q2076890) (← links)
• Benders decomposition applied to profit maximizing hub location problem with incomplete hub network (Q2146970) (← links)
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
• Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion (Q2292358) (← links)
• Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints (Q2294760) (← links)
• Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut (Q2299984) (← links)
• Solution of preemptive multi-objective network design problems applying Benders decomposition method (Q2442088) (← links)
• Simultaneously exploiting two formulations: an exact Benders decomposition approach (Q2664373) (← links)
• The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach (Q2668681) (← links)
• Benders decomposition for network design covering problems (Q2669611) (← links)
• A taxonomy of multilayer network design and a survey of transportation and telecommunication applications (Q2673552) (← links)
• Benders Decomposition for Capacitated Network Design (Q2835663) (← links)
• Exact approaches to the single-source network loading problem (Q2892148) (← links)
• Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks (Q2940074) (← links)
• Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
• Benders Decomposition for Production Routing Under Demand Uncertainty (Q3465587) (← links)
• A polyhedral study of the capacity formulation of the multilayer network design problem (Q5326800) (← links)
• A branch‐and‐cut algorithm for hub network design problems with profits (Q6051584) (← links)
• Telecommunications network design: Technology impacts and future directions (Q6087074) (← links)
• A survivable variant of the ring star problem (Q6196876) (← links)
• Experimentation with Benders decomposition for solving the two-timescale stochastic generation capacity expansion problem (Q6491325) (← links)