Pages that link to "Item:Q2899064"

The following pages link to Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem (Q2899064):

Displayed 31 items.

• Consolidating home meal delivery with limited operational disruption (Q319069) ‎ (← links)
• A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem (Q323161) ‎ (← links)
• The synchronized arc and node routing problem: application to road marking (Q336355) ‎ (← links)
• Heuristics for dynamic and stochastic inventory-routing (Q337178) ‎ (← links)
• A hybrid method for the probabilistic maximal covering location-allocation problem (Q337483) ‎ (← links)
• Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs (Q683326) ‎ (← links)
• Restrict-and-relax search for 0-1 mixed-integer programs (Q743638) ‎ (← 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)
• Combined column-and-row-generation for the optimal communication spanning tree problem (Q1652585) ‎ (← links)
• Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) ‎ (← links)
• The inventory-routing problem with transshipment (Q1761192) ‎ (← links)
• Computational risk management techniques for fixed charge network flow problems with uncertain arc failures (Q1945698) ‎ (← 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)
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) ‎ (← links)
• Scheduling of maintenance windows in a mining supply chain rail network (Q2289897) ‎ (← links)
• Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion (Q2292358) ‎ (← links)
• A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts (Q2307262) ‎ (← links)
• Approximability of capacitated network design (Q2354026) ‎ (← 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)
• The transit time constrained fixed charge multi-commodity network design problem (Q2669603) ‎ (← links)
• Scheduled Service Network Design for Freight Rail Transportation (Q2875607) ‎ (← links)
• Approximability of Capacitated Network Design (Q3009752) ‎ (← links)
• Decomposing inventory routing problems with approximate value functions (Q3065633) ‎ (← links)
• Minimum-Cost Network Design with (Dis)economies of Scale (Q3464060) ‎ (← links)
• LP Formulations for Polynomial Optimization Problems (Q4637509) ‎ (← links)
• MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem (Q5149549) ‎ (← links)
• Minimum‐cost flow problems having arc‐activation costs (Q6077360) ‎ (← links)