A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
From MaRDI portal
Publication:4838243
DOI10.1287/opre.43.1.130zbMath0830.90049OpenAlexW2141018803MaRDI QIDQ4838243
Publication date: 1 August 1995
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.43.1.130
Related Items
Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem ⋮ Exactly solving a two-level location problem with modular node capacities ⋮ Layered graph approaches for combinatorial optimization problems ⋮ Single PON network design with unconstrained splitting stages ⋮ Unnamed Item ⋮ A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem ⋮ Flow-based formulation for the maximum leaf spanning tree problem ⋮ A biased random-key genetic algorithm for the capacitated minimum spanning tree problem ⋮ Discretized formulations for capacitated location problems with modular distribution costs ⋮ A Branch-and-Bound Algorithm for Building Optimal Data Gathering Tree in Wireless Sensor Networks ⋮ Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints ⋮ Temporal constraints and device management for the skill VRP: mathematical model and lower bounding techniques ⋮ A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint ⋮ Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem ⋮ Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations ⋮ Optimizing wind farm cable layout considering ditch sharing ⋮ Enhancing discretized formulations: the knapsack reformulation and the star reformulation ⋮ An Integer Programming Model for Branching Cable Layouts in Offshore Wind Farms ⋮ The travelling salesman problem with positional consistency constraints: an application to healthcare services ⋮ RAMP for the capacitated minimum spanning tree problem ⋮ Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem ⋮ Heuristics for the multi-level capacitated minimum spanning tree problem ⋮ Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs ⋮ A multiperiod planning model for the capacitated minimal spanning tree problem ⋮ Solving the variable size bin packing problem with discretized formulations ⋮ Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation ⋮ Reformulation by discretization: application to economic lot sizing ⋮ A Lagrangian based heuristic for the design of multipoint linkages in a communication network with unreliable links and node outage costs. ⋮ Models and heuristics for the k ‐degree constrained minimum spanning tree problem with node‐degree costs ⋮ A survey on Benders decomposition applied to fixed-charge network design problems ⋮ Solving the maximum edge-weight clique problem in sparse graphs with compact formulations ⋮ A new extended formulation of the generalized assignment problem and some associated valid inequalities ⋮ Unnamed Item ⋮ The capacitated minimum spanning tree problem: revisiting hop-indexed formulations ⋮ On the capacitated concentrator location problem: a reformulation by discretization ⋮ GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem ⋮ Minimal spanning trees with a constraint on the number of leaves ⋮ Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees ⋮ Heuristic procedure neural networks for the CMST problem ⋮ Savings based ant colony optimization for the capacitated minimum spanning tree problem ⋮ About Lagrangian methods in integer optimization
This page was built for publication: A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem