Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
From MaRDI portal
Publication:2465657
DOI10.1007/S10107-006-0043-YzbMATH Open1146.90059OpenAlexW1990399046MaRDI QIDQ2465657FDOQ2465657
Authors: Eduardo Uchoa, Ricardo Fukasawa, Jens Lysgaard, Artur Alves Pessoa, Marcus Poggi de Aragão, Diogo V. Andrade 
Publication date: 7 January 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0043-y
Recommendations
- A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
- A branch and bound algorithm for the capacitated minimum spanning tree problem
- The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Modular representations and characters (20C20) Maximal subgroups (20E28) Linear algebraic groups over finite fields (20G40)
Cites Work
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Title not available (Why is that?)
- Branch-and-price: Column generation for solving huge integer programs
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- The volume algorithm: Producing primal solutions with a subgradient method
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- 2-path cuts for the vehicle routing problem with time windows
- Lot-sizing with start-up times
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- On the capacitated concentrator location problem: a reformulation by discretization
- Solving capacitated arc routing problems using a transformation to the CVRP
- Projection results for vehicle routing
- Title not available (Why is that?)
- A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
- The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
- The capacitated minimum spanning tree problem: On improved multistar constraints
- A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
- Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
- Multistars and directed flow formulations
- Title not available (Why is that?)
- Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
- The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
- Models and heuristics for a minimum arborescence problem
- A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
- Multimodal Express Package Delivery: A Service Network Design Application
- An exact algorithm for the capacitated shortest spanning arborescence
- A Polyhedral Intersection Theorem for Capacitated Spanning Trees
- A branch and bound algorithm for the capacitated minimum spanning tree problem
- Exact solution of the centralized network design problem on directed graphs
Cited In (30)
- Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
- RAMP for the capacitated minimum spanning tree problem
- A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
- A branch-and-price-and-cut algorithm for the cable-routing problem in solar power plants
- Layered graph approaches for combinatorial optimization problems
- ILP formulation of the degree-constrained minimum spanning hierarchy problem
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- On the edge capacitated Steiner tree problem
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
- Improved lower bounds for the split delivery vehicle routing problem
- Petroleum supply planning: reformulations and a novel decomposition algorithm
- On a generalization of the master cyclic group polyhedron
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- A branch-and-price algorithm for the ring-tree facility location problem
- Some recent contributions to network optimization
- 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
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
- A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
- An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree 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
- A new extended formulation of the generalized assignment problem and some associated valid inequalities
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
Uses Software
This page was built for publication: Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465657)
