Pages that link to "Item:Q4838243"

The following pages link to A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem (Q4838243):

Displaying 43 items.

• Flow-based formulation for the maximum leaf spanning tree problem (Q324785) (← links)
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (Q337493) (← links)
• A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980) (← links)
• About Lagrangian methods in integer optimization (Q817183) (← links)
• The capacitated minimal spanning tree problem: An experiment with a hop-indexed model (Q1290151) (← links)
• Minimal spanning trees with a constraint on the number of leaves (Q1291653) (← links)
• Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees (Q1577774) (← links)
• Heuristic procedure neural networks for the CMST problem (Q1579025) (← links)
• Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
• Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126) (← links)
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
• A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759) (← links)
• The capacitated minimum spanning tree problem: revisiting hop-indexed formulations (Q1772873) (← links)
• The capacitated minimum spanning tree problem: On improved multistar constraints (Q1887863) (← links)
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints (Q1919978) (← links)
• Enhancing discretized formulations: the knapsack reformulation and the star reformulation (Q1935879) (← links)
• Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs (Q1969869) (← links)
• A multiperiod planning model for the capacitated minimal spanning tree problem (Q1969870) (← links)
• A new extended formulation of the generalized assignment problem and some associated valid inequalities (Q2009013) (← links)
• A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem (Q2147081) (← links)
• Solving the maximum edge-weight clique problem in sparse graphs with compact formulations (Q2260912) (← links)
• GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem (Q2271122) (← links)
• RAMP for the capacitated minimum spanning tree problem (Q2430627) (← links)
• Heuristics for the multi-level capacitated minimum spanning tree problem (Q2448129) (← links)
• Solving the variable size bin packing problem with discretized formulations (Q2462559) (← links)
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657) (← links)
• Reformulation by discretization: application to economic lot sizing (Q2465954) (← links)
• A Lagrangian based heuristic for the design of multipoint linkages in a communication network with unreliable links and node outage costs. (Q2468608) (← links)
• On the capacitated concentrator location problem: a reformulation by discretization (Q2496022) (← links)
• Savings based ant colony optimization for the capacitated minimum spanning tree problem (Q2581619) (← links)
• Single PON network design with unconstrained splitting stages (Q2629639) (← links)
• Discretized formulations for capacitated location problems with modular distribution costs (Q2655611) (← links)
• Temporal constraints and device management for the skill VRP: mathematical model and lower bounding techniques (Q2664406) (← links)
• Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations (Q2676343) (← links)
• Spanning trees with node degree cependent costs and knapsack reformulations (Q2861520) (← links)
• Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem (Q2892153) (← links)
• Exactly solving a two-level location problem with modular node capacities (Q2892154) (← links)
• Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687) (← links)
• A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem (Q4944737) (← links)
• A Branch-and-Bound Algorithm for Building Optimal Data Gathering Tree in Wireless Sensor Networks (Q5084608) (← links)
• An Integer Programming Model for Branching Cable Layouts in Offshore Wind Farms (Q5356966) (← links)
• Optimizing wind farm cable layout considering ditch sharing (Q6060691) (← links)
• The travelling salesman problem with positional consistency constraints: an application to healthcare services (Q6167660) (← links)