Memetic algorithms (Q2573010)

From MaRDI portal

Revision as of 08:44, 19 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: Memetic algorithms

scientific article

Language	Label	Description	Also known as
English	Memetic algorithms	scientific article

Statements

scholarly article

0 references

Memetic algorithms (English)

0 references

José Luis González-Velarde

0 references

0 references

0 references

Journal of Heuristics

0 references

publication date

7 November 2005

0 references

zbMATH Keywords

network design

0 references

Scatter Search

0 references

GRASP

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

0 references

full work available at URL

https://doi.org/10.1007/s10732-005-1509-4

0 references

A GRASP for aircraft routing in response to groundings and delays

0 references

A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design

0 references

0 references

Bundle-based relaxation methods for multicommodity capacitated fixed charge network design

0 references

A Simplex-Based Tabu Search Method for Capacitated Network Design

0 references

Minimizing labor requirements in a periodic vehicle loading problem

0 references

A probabilistic heuristic for a computationally difficult set covering problem

0 references

Greedy randomized adaptive search procedures

0 references

GRASP for seam drawing in mosaicking of aerial photographic maps

0 references

Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory

0 references

A dual ascent approach to the fixed-charge capacitated network design problem

0 references

Analysis of a flow problem with fixed charges

0 references

Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound

0 references

A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem

0 references

The complexity of the network design problem

0 references

0 references

Scatter search. Methodology and implementation in C. With CD-ROM.

0 references

A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem

0 references

Tailoring Benders decomposition for uncapacitated network design

0 references

Solving two location models with few facilities by using a hybrid heuristic: a real health resources case

0 references

Benders-and-cut algorithm for fixed-charge capacitated network design problem

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S10732-005-1509-4

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2573010

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2573010&oldid=39151228"