Pages that link to "Item:Q5955562"
From MaRDI portal
The following pages link to Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem (Q5955562):
Displaying 35 items.
- Optimal capacitated ring trees (Q286687) (← links)
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (Q337493) (← links)
- Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling (Q342395) (← links)
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks (Q360513) (← links)
- Cyclic transfers in school timetabling (Q421072) (← links)
- Constraint-based very large-scale neighborhood search (Q434452) (← links)
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand (Q519091) (← links)
- A survey of search methodologies and automated system development for examination timetabling (Q835639) (← links)
- A multi-objective evolutionary algorithm for examination timetabling (Q842554) (← links)
- Enhanced second order algorithm applied to the capacitated minimum spanning tree problem (Q869013) (← links)
- Edge exchanges in the degree-constrained minimum spanning tree problem (Q1086497) (← links)
- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables (Q1628128) (← links)
- A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (Q1695027) (← links)
- Managing the tabu list length using a fuzzy inference system: an application to examination timetabling (Q1761914) (← links)
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. (Q1811625) (← links)
- The capacitated minimum spanning tree problem: On improved multistar constraints (Q1887863) (← links)
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) (← links)
- Design of capacitated degree constrained min-sum arborescence (Q2085507) (← links)
- A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem (Q2147081) (← links)
- Algorithms for the design of network topologies with balanced disjoint rings (Q2267818) (← links)
- GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem (Q2271122) (← links)
- RAMP for the capacitated minimum spanning tree problem (Q2430627) (← links)
- Heuristics for the multi-level capacitated minimum spanning tree problem (Q2448129) (← links)
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657) (← links)
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (Q2491319) (← links)
- Creating very large scale neighborhoods out of smaller ones by compounding moves (Q2491337) (← links)
- Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
- Savings based ant colony optimization for the capacitated minimum spanning tree problem (Q2581619) (← links)
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem (Q2892153) (← links)
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems (Q2950521) (← links)
- Large-scale local search heuristics for the capacitated vertex<i>p</i>-center problem (Q4474299) (← links)
- A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants (Q4995082) (← links)
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité (Q5479860) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5899416) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5900890) (← links)
