Memetic algorithms (Q2573010): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10732-005-1509-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060772174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP for aircraft routing in response to groundings and delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplex-Based Tabu Search Method for Capacitated Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing labor requirements in a periodic vehicle loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic heuristic for a computationally difficult set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP for seam drawing in mosaicking of aerial photographic maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent approach to the fixed-charge capacitated network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a flow problem with fixed charges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scatter search. Methodology and implementation in C. With CD-ROM. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tailoring Benders decomposition for uncapacitated network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving two location models with few facilities by using a hybrid heuristic: a real health resources case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders-and-cut algorithm for fixed-charge capacitated network design problem / rank
 
Normal rank

Latest revision as of 12:23, 11 June 2024

scientific article
Language Label Description Also known as
English
Memetic algorithms
scientific article

    Statements

    Memetic algorithms (English)
    0 references
    0 references
    0 references
    7 November 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    network design
    0 references
    Scatter Search
    0 references
    GRASP
    0 references
    0 references
    0 references
    0 references