Pages that link to "Item:Q1582048"
From MaRDI portal
The following pages link to Benders-and-cut algorithm for fixed-charge capacitated network design problem (Q1582048):
Displaying 21 items.
- A new approach for solving the network problems (Q505104) (← links)
- Benders, metric and cutset inequalities for multicommodity capacitated network design (Q632387) (← links)
- Scatter search for network design problem (Q817138) (← links)
- Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← links)
- A Benders decomposition algorithm for base station planning problem in WCDMA networks (Q858274) (← links)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints (Q1662655) (← links)
- A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759) (← links)
- Benders decomposition: solving binary master problems by enumeration (Q1785474) (← links)
- Exact solutions for the collaborative pickup and delivery problem (Q1787916) (← links)
- A branch-and-cut algorithm for capacitated network design problems (Q1806022) (← links)
- An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes (Q1994496) (← links)
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality (Q2077967) (← 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)
- A global optimization algorithm for reliable network design (Q2379515) (← links)
- Solving a capacitated hub location problem (Q2384615) (← links)
- Solution of preemptive multi-objective network design problems applying Benders decomposition method (Q2442088) (← links)
- Memetic algorithms (Q2573010) (← links)
- LP extreme points and cuts for the fixed-charge network design problem (Q3778564) (← links)
- Benders decomposition approach for the robust network design problem with flow bifurcations (Q5326799) (← links)
