A genetic-based framework for solving (multi-criteria) weighted matching problems. (Q1811148): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4276004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted matching with vertex weights: An application to scheduling training sessions in NASA space shuttle cockpit simulators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Minimum-Weight Perfect Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving (large scale) matching problems combinatorially / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey and annotated bibliography of multiobjective combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5527536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster scaling algorithms for general graph matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for general matching problems using network flow subproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: General local search methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Greedy Heuristic for Complete Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3897937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3223667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithm approach on multi-criteria minimum spanning tree problem / rank
 
Normal rank

Latest revision as of 17:30, 5 June 2024

scientific article
Language Label Description Also known as
English
A genetic-based framework for solving (multi-criteria) weighted matching problems.
scientific article

    Statements

    A genetic-based framework for solving (multi-criteria) weighted matching problems. (English)
    0 references
    0 references
    0 references
    10 June 2003
    0 references
    0 references
    Genetic algorithms
    0 references
    Multi-objective evolutionary algorithms
    0 references
    Multi-criteria
    0 references
    optimization
    0 references
    Weighted matching
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references