A genetic-based framework for solving (multi-criteria) weighted matching problems.

DOI10.1016/S0377-2217(02)00484-8zbMath1035.90073OpenAlexW2003749640WikidataQ58760178 ScholiaQ58760178MaRDI QIDQ1811148

Shu-Cherng Fang, Andrés L. Medaglia

Publication date: 10 June 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00484-8

zbMATH Keywords

optimizationGenetic algorithmsMulti-criteriaMulti-objective evolutionary algorithmsWeighted matching

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items

Approximating the Pareto frontier for a challenging real-world bi-objective covering problem ⋮ Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example ⋮ Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem

Uses Software

• Genocop
• Blossom IV
• NBI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Solving (large scale) matching problems combinatorially
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints
• General local search methods
• Weighted matching with vertex weights: An application to scheduling training sessions in NASA space shuttle cockpit simulators
• Genetic algorithm approach on multi-criteria minimum spanning tree problem
• A survey and annotated bibliography of multiobjective combinatorial optimization
• An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
• A new algorithm for general matching problems using network flow subproblems
• On a Greedy Heuristic for Complete Matching
• Faster scaling algorithms for general graph matching problems
• Computing Minimum-Weight Perfect Matchings
• A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Maximum matching and a polyhedron with 0,1-vertices