Pages that link to "Item:Q702717"

The following pages link to Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design (Q702717):

Displaying 39 items.

• A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem (Q323161) (← links)
• Double resource optimization for a robust computer network subject to a transmission budget (Q331840) (← links)
• Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
• Benders, metric and cutset inequalities for multicommodity capacitated network design (Q632387) (← links)
• A unified framework for population-based metaheuristics (Q646652) (← links)
• A hybrid algorithm for large-scale service network design considering a heterogeneous fleet (Q666955) (← links)
• A metaheuristic for stochastic service network design (Q707730) (← links)
• A capacity scaling heuristic for the multicommodity capacitated network design problem (Q837097) (← links)
• A hybrid meta-heuristic for the batching problem in just-in-time flow shops (Q864936) (← links)
• Tabu search-based metaheuristic algorithm for software system reliability problems (Q955616) (← 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)
• Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network (Q1639274) (← 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)
• Optimisation of transportation service network using \(\kappa\)-node large neighbourhood search (Q1652466) (← links)
• Design of sensor networks for chemical plants based on meta-heuristics (Q1662455) (← links)
• Stochastic multi-commodity network design: the quality of deterministic solutions (Q1728226) (← 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)
• Near real-time loadplan adjustments for less-than-truckload carriers (Q2140287) (← links)
• Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
• Algorithms for the non-bifurcated network design problem (Q2271128) (← links)
• A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design (Q2357911) (← links)
• TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem (Q2378415) (← links)
• A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
• A first multilevel cooperative algorithm for capacitated multicommodity network design (Q2489307) (← links)
• Path relinking for the vehicle routing problem (Q2491329) (← links)
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
• Scheduled Service Network Design for Freight Rail Transportation (Q2875607) (← links)
• Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout (Q3055322) (← links)
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
• A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location (Q3532778) (← links)
• Accelerating benders decomposition with heuristicmaster problem solutions (Q4904321) (← links)
• MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem (Q5149549) (← links)
• A scheme for determining vehicle routes based on Arc-based service network design (Q5881488) (← links)
• Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)