Pages that link to "Item:Q5946817"

The following pages link to Bundle-based relaxation methods for multicommodity capacitated fixed charge network design (Q5946817):

Displaying 50 items.

• An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP (Q319782) (← links)
• Improved branching disjunctions for branch-and-bound: an analytic center approach (Q319920) (← links)
• A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem (Q323161) (← links)
• Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks (Q336554) (← links)
• A continuous bi-level model for the expansion of highway networks (Q336804) (← links)
• Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
• Model-based automatic neighborhood design by unsupervised learning (Q337347) (← links)
• A stabilized structured Dantzig-Wolfe decomposition method (Q359629) (← 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)
• A hybrid algorithm for large-scale service network design considering a heterogeneous fleet (Q666955) (← links)
• About Lagrangian methods in integer optimization (Q817183) (← links)
• Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← 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)
• A hub location problem with fully interconnected backbone and access networks (Q869014) (← links)
• Cyclic preference scheduling of nurses using a Lagrangian-based heuristic (Q880573) (← links)
• Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design (Q925847) (← links)
• Reconstructing (0,1)-matrices from projections using integer programming (Q1001203) (← 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)
• Service network design in freight transportation (Q1582187) (← links)
• Planning models for long-haul operations of postal and express shipment companies (Q1582188) (← links)
• A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem'' (Q1600948) (← links)
• The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
• A comparison of formulations and relaxations for cross-dock door assignment problems (Q1652605) (← links)
• A method for convex minimization based on translated first-order approximations (Q1681778) (← links)
• On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
• Fixed charge multicommodity network design using \(p\)-partition facets (Q1698889) (← links)
• Multi-commodity variable upper bound flow models (Q1751124) (← links)
• Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← links)
• Efficient metaheuristics to solve the intermodal terminal location problem (Q1761128) (← 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)
• Alternating Lagrangian decomposition for integrated airline crew scheduling problem (Q2189931) (← links)
• Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
• A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints (Q2288988) (← 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)
• Revisiting Lagrangian relaxation for network design (Q2414466) (← links)
• A class of Dantzig-Wolfe type decomposition methods for variational inequality problems (Q2436644) (← links)
• An interior-point Benders based branch-and-cut algorithm for mixed integer programs (Q2442074) (← links)
• Service network design models for two-tier city logistics (Q2448205) (← 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)
• Solving network design problems via iterative aggregation (Q2516352) (← links)
• Memetic algorithms (Q2573010) (← links)
• COLE: a new heuristic approach for fixed charge problem computational results (Q2573014) (← links)