A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem

From MaRDI portal
Publication:4838243

DOI10.1287/opre.43.1.130zbMath0830.90049OpenAlexW2141018803MaRDI QIDQ4838243

Luís Gouveia

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 problemExactly solving a two-level location problem with modular node capacitiesLayered graph approaches for combinatorial optimization problemsSingle PON network design with unconstrained splitting stagesUnnamed ItemA hybrid evolutionary algorithm for the capacitated minimum spanning tree problemFlow-based formulation for the maximum leaf spanning tree problemA biased random-key genetic algorithm for the capacitated minimum spanning tree problemDiscretized formulations for capacitated location problems with modular distribution costsA Branch-and-Bound Algorithm for Building Optimal Data Gathering Tree in Wireless Sensor NetworksUsing the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraintsTemporal constraints and device management for the skill VRP: mathematical model and lower bounding techniquesA branch-and-price algorithm for the variable size bin packing problem with minimum filling constraintExtended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problemFinding \(K\) dissimilar paths: single-commodity and discretized flow formulationsOptimizing wind farm cable layout considering ditch sharingEnhancing discretized formulations: the knapsack reformulation and the star reformulationAn Integer Programming Model for Branching Cable Layouts in Offshore Wind FarmsThe travelling salesman problem with positional consistency constraints: an application to healthcare servicesRAMP for the capacitated minimum spanning tree problemAlternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problemHeuristics for the multi-level capacitated minimum spanning tree problemValid inequalities for non-unit demand capacitated spanning tree problems with flow costsA multiperiod planning model for the capacitated minimal spanning tree problemSolving the variable size bin packing problem with discretized formulationsRobust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulationReformulation by discretization: application to economic lot sizingA 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 costsA survey on Benders decomposition applied to fixed-charge network design problemsSolving the maximum edge-weight clique problem in sparse graphs with compact formulationsA new extended formulation of the generalized assignment problem and some associated valid inequalitiesUnnamed ItemThe capacitated minimum spanning tree problem: revisiting hop-indexed formulationsOn the capacitated concentrator location problem: a reformulation by discretizationGRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problemMinimal spanning trees with a constraint on the number of leavesMultiple center capacitated arc routing problems: A tabu search algorithm using capacitated treesHeuristic procedure neural networks for the CMST problemSavings based ant colony optimization for the capacitated minimum spanning tree problemAbout Lagrangian methods in integer optimization




This page was built for publication: A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem