Pages that link to "Item:Q2465657"

The following pages link to Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657):

Displayed 29 items.

• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (Q337493) ‎ (← links)
• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems (Q621754) ‎ (← links)
• Improved lower bounds for the split delivery vehicle routing problem (Q991469) ‎ (← links)
• Layered graph approaches for combinatorial optimization problems (Q1628112) ‎ (← links)
• ILP formulation of the degree-constrained minimum spanning hierarchy problem (Q1631637) ‎ (← links)
• Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems (Q1651704) ‎ (← links)
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) ‎ (← links)
• Enhancing discretized formulations: the knapsack reformulation and the star reformulation (Q1935879) ‎ (← links)
• On a generalization of the master cyclic group polyhedron (Q1960187) ‎ (← links)
• A new extended formulation of the generalized assignment problem and some associated valid inequalities (Q2009013) ‎ (← links)
• A branch-and-price algorithm for the ring-tree facility location problem (Q2132327) ‎ (← links)
• A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem (Q2147081) ‎ (← links)
• On the edge capacitated Steiner tree problem (Q2218647) ‎ (← links)
• GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem (Q2271122) ‎ (← links)
• Petroleum supply planning: reformulations and a novel decomposition algorithm (Q2358145) ‎ (← links)
• RAMP for the capacitated minimum spanning tree problem (Q2430627) ‎ (← links)
• Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams (Q2806865) ‎ (← links)
• (Q2861520) ‎ (← links)
• Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem (Q2892153) ‎ (← links)
• A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem (Q3057116) ‎ (← links)
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems (Q3564362) ‎ (← links)
• Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687) ‎ (← links)
• Some recent contributions to network optimization (Q4812397) ‎ (← links)
• A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants (Q4995082) ‎ (← links)
• Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty (Q5003707) ‎ (← links)
• A Branch-and-Bound Algorithm for Building Optimal Data Gathering Tree in Wireless Sensor Networks (Q5084608) ‎ (← links)
• An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems (Q5139849) ‎ (← links)
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561) ‎ (← links)
• New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (Q6109802) ‎ (← links)