A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
From MaRDI portal
Publication:4838243
DOI10.1287/OPRE.43.1.130zbMATH Open0830.90049OpenAlexW2141018803MaRDI QIDQ4838243FDOQ4838243
Authors: Luis 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
Recommendations
- The capacitated minimum spanning tree problem: On improved multistar constraints
- The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
- The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
- A branch and bound algorithm for the capacitated minimum spanning tree problem
- Publication:4944737
Cited In (43)
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- Minimal spanning trees with a constraint on the number of leaves
- RAMP for the capacitated minimum spanning tree problem
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- Savings based ant colony optimization for the capacitated minimum spanning tree problem
- An integer programming model for branching cable layouts in offshore wind farms
- Exactly solving a two-level location problem with modular node capacities
- Layered graph approaches for combinatorial optimization problems
- Heuristic procedure neural networks for the CMST problem
- Single PON network design with unconstrained splitting stages
- The travelling salesman problem with positional consistency constraints: an application to healthcare services
- A Lagrangian based heuristic for the design of multipoint linkages in a communication network with unreliable links and node outage costs.
- Optimizing wind farm cable layout considering ditch sharing
- Heuristics for the multi-level capacitated minimum spanning tree problem
- About Lagrangian methods in integer optimization
- A multiperiod planning model for the capacitated minimal spanning tree problem
- Reformulation by discretization: application to economic lot sizing
- Multistars and directed flow formulations
- Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs
- Flow-based formulation for the maximum leaf spanning tree problem
- Title not available (Why is that?)
- Temporal constraints and device management for the skill VRP: mathematical model and lower bounding techniques
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
- Enhancing discretized formulations: the knapsack reformulation and the star reformulation
- Models and heuristics for the \(k\)-degree constrained minimum spanning tree problem with node-degree costs
- GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations
- A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
- A survey on Benders decomposition applied to fixed-charge network design problems
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
- Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
- The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
- A branch-and-bound algorithm for building optimal data gathering tree in wireless sensor networks
- Spanning trees with node degree cependent costs and knapsack reformulations
- The capacitated minimum spanning tree problem: On improved multistar constraints
- A new extended formulation of the generalized assignment problem and some associated valid inequalities
- On the capacitated concentrator location problem: a reformulation by discretization
- Discretized formulations for capacitated location problems with modular distribution costs
- Solving the variable size bin packing problem with discretized formulations
This page was built for publication: A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4838243)
