Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
From MaRDI portal
Recommendations
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
- The multilevel capacitated minimum spanning tree problem
- Heuristics for the multi-level capacitated minimum spanning tree problem
- Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
- The capacitated minimum spanning tree problem: On improved multistar constraints
Cited in
(38)- Edge exchanges in the degree-constrained minimum spanning tree problem
- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables
- A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
- Managing the tabu list length using a fuzzy inference system: an application to examination timetabling
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
- The capacitated minimum spanning tree problem: On improved multistar constraints
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
- Design of capacitated degree constrained min-sum arborescence
- A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
- Algorithms for the design of network topologies with balanced disjoint rings
- GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
- RAMP for the capacitated minimum spanning tree problem
- Heuristics for the multi-level capacitated minimum spanning tree problem
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem
- Creating very large scale neighborhoods out of smaller ones by compounding moves
- Fast local search algorithms for the handicapped persons transportation problem
- Savings based ant colony optimization for the capacitated minimum spanning tree problem
- Multi-exchange neighborhoods for the capacitated ring tree problem
- Optimal capacitated ring trees
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
- Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
- Cyclic transfers in school timetabling
- Constraint-based very large-scale neighborhood search
- Large-scale local search heuristics for the capacitated vertexp-center problem
- A branch-and-price-and-cut algorithm for the cable-routing problem in solar power plants
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
- Ejection chain and filter-and-fan methods in combinatorial optimization
- Ejection chain and filter-and-fan methods in combinatorial optimization
- A k-swap local search for makespan scheduling
- Smoothed analysis of the k-swap neighborhood for makespan scheduling
- A survey of search methodologies and automated system development for examination timetabling
- A multi-objective evolutionary algorithm for examination timetabling
- Enhanced second order algorithm applied to the capacitated minimum spanning tree problem
This page was built for publication: Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5955562)
