Pages that link to "Item:Q4427333"

The following pages link to A Simplex-Based Tabu Search Method for Capacitated Network Design (Q4427333):

Displaying 42 items.

• Multimodal freight transportation planning: a literature review (Q297170) (← links)
• A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem (Q323161) (← links)
• Single source single-commodity stochastic network design (Q373182) (← links)
• A Lagrangian relaxation approach for expansion of a highway network (Q512983) (← links)
• Benders, metric and cutset inequalities for multicommodity capacitated network design (Q632387) (← links)
• Scatter search for network design problem (Q817138) (← links)
• Metaheuristics in combinatorial optimization (Q817206) (← 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)
• Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
• Service network design in freight transportation (Q1582187) (← links)
• The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← 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)
• Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← links)
• A review of transport market modeling using game-theoretic principles (Q2030641) (← 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)
• Algorithms for an integer multicommodity network flow problem with node reliability considerations (Q2247900) (← 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)
• A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
• Metric inequalities and the network loading problem (Q2471279) (← 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)
• The single-node dynamic service scheduling and dispatching problem (Q2572807) (← links)
• Memetic algorithms (Q2573010) (← links)
• The transit time constrained fixed charge multi-commodity network design problem (Q2669603) (← links)
• Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout (Q3055322) (← links)
• Effective material flow at an assembly facility (Q3168925) (← links)
• A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location (Q3532778) (← links)
• Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité (Q5479860) (← links)
• A scheme for determining vehicle routes based on Arc-based service network design (Q5881488) (← links)
• Integrating operations research in constraint programming (Q5898341) (← links)
• Integrating operations research in constraint programming (Q5900889) (← links)
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design (Q5946817) (← links)
• Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
• Avoiding unnecessary demerging and remerging of multi‐commodity integer flows (Q6092659) (← links)
• Metaheuristics: A Canadian Perspective (Q6102854) (← links)