A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
From MaRDI portal
Publication:360513
Recommendations
- A note on genetic algorithms for degree-constrained spanning tree problems
- The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach
- A genetic algorithm approach on tree-like telecommunication network design problem
- Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems
- An approach to a problem in network design using genetic algorithms
Cites work
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- A branch and bound algorithm for the robust spanning tree problem with interval data
- A branch-and-bound algorithm for concave network flow problems
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
- A genetic algorithm for the resource constrained multi-project scheduling problem
- A hop constrained min-sum arborescence with outage costs
- A hybrid genetic algorithm for the job shop scheduling problem
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
- Adjacent extreme flows and application to min concave cost flow problems
- Bilinear modeling solution approach for fixed charge network flow problems
- Heuristic solutions for general concave minimum cost network flow problems
- Introduction to algorithms
- Large-Scale Network Topological Optimization
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
- Multicommodity flow models for spanning trees with hop constraints
- Network design techniques using adapted genetic algorithms
- On formulations and methods for the hop-constrained minimum spanning tree problem
- Packet reordering in networks with heavy-tailed delays
- The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
- Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
Cited in
(10)- scientific article; zbMATH DE number 2040760 (Why is no real title available?)
- Optimizing job shop scheduling with speed-adjustable machines and peak power constraints: a mathematical model and heuristic solutions
- A genetic algorithm approach on tree-like telecommunication network design problem
- A Genetic Algorithm for Scheduling Alternative Tasks Subject to Technical Failure
- A new spanning tree-based genetic algorithm for the design of multi-stage supply chain networks with nonlinear transportation costs
- A biased random-key genetic algorithm for the tree of hubs location problem
- A biased random-key genetic algorithm for the unequal area facility layout problem
- A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects
- The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach
- A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation
This page was built for publication: A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360513)
