Pages that link to "Item:Q1771210"
From MaRDI portal
The following pages link to A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design (Q1771210):
Displaying 28 items.
- Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
- Benders, metric and cutset inequalities for multicommodity capacitated network design (Q632387) (← links)
- A capacity scaling heuristic for the multicommodity capacitated network design problem (Q837097) (← links)
- An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems (Q853587) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- A local branching heuristic for the capacitated fixed-charge network design problem (Q1038297) (← links)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← links)
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301) (← links)
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality (Q2077967) (← links)
- Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure (Q2147939) (← links)
- A Benders decomposition-based approach for logistics service network design (Q2184143) (← links)
- Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← links)
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design (Q2357911) (← links)
- A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
- Service network design models for two-tier city logistics (Q2448205) (← links)
- A first multilevel cooperative algorithm for capacitated multicommodity network design (Q2489307) (← links)
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
- Lower and upper bounds for a two-stage capacitated facility location problem with handling costs (Q2514748) (← links)
- COLE: a new heuristic approach for fixed charge problem computational results (Q2573014) (← links)
- New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem (Q2669599) (← links)
- A taxonomy of multilayer network design and a survey of transportation and telecommunication applications (Q2673552) (← links)
- Scheduled service network design for freight rail transportation (Q2875607) (← links)
- Modeling and solving a multimodal transportation problem with flexible-time and scheduled services (Q3076017) (← links)
- Progressive hedging-based metaheuristics for stochastic network design (Q3100691) (← links)
- Accelerating benders decomposition with heuristicmaster problem solutions (Q4904321) (← links)
- Minimum‐cost flow problems having arc‐activation costs (Q6077360) (← links)
