Pages that link to "Item:Q1038297"

The following pages link to A local branching heuristic for the capacitated fixed-charge network design problem (Q1038297):

Displaying 23 items.

• A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem (Q323161) (← links)
• A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow (Q342561) (← links)
• The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
• A parallel local search framework for the fixed-charge multicommodity network flow problem (Q1652019) (← links)
• Matheuristics for the single-path design-balanced service network design problem (Q1652031) (← links)
• Generalized local branching heuristics and the capacitated ring tree problem (Q1744240) (← links)
• A local branching heuristic for the open pit mine production scheduling problem (Q1752798) (← 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)
• Warm-start heuristic for stochastic portfolio optimization with fixed and proportional transaction costs (Q2247929) (← links)
• A MIP-based approach to solve the prize-collecting local access network design problem (Q2256343) (← 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)
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
• New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem (Q2669599) (← links)
• The transit time constrained fixed charge multi-commodity network design problem (Q2669603) (← links)
• A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem (Q3156821) (← links)
• (Q3840281) (← links)
• MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem (Q5149549) (← links)
• Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
• Minimum‐cost flow problems having arc‐activation costs (Q6077360) (← links)