The biobjective minimum-cost perfect matching problem and Chinese postman problem

DOI10.1111/ITOR.13363MaRDI QIDQ6495384zbMATH OpenFDO

Authors Miguel A. Pozo, Justo Puerto, Ignacio Roldán

Publication date 30 April 2024

Published in International Transactions in Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1111/ITOR.13363

zbMATH Keywords

biobjective optimizationCPPPareto frontPMP

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Approximation with a fixed number of solutions of some multiobjective maximization problems
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Core solutions in vector-valued games
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 915988 (Why is no real title available?)
• scientific article; zbMATH DE number 1417899 (Why is no real title available?)
• Integer Programming and Combinatorial Optimization
• Matching, Euler tours and the Chinese postman
• Maximum matching and a polyhedron with 0,1-vertices
• Minimum perfect bipartite matchings and spanning trees under categorization
• Multicriteria Optimization
• Multiobjective solution of the uncapacitated plant location problem
• Odd Minimum Cut-Sets and b-Matchings
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• Optimal location of a path or tree on a network with cycles
• Ordered weighted average combinatorial optimization: formulations and their properties
• Reducibility among combinatorial problems
• Solving matching problems with linear programming
• Two phase algorithms for the bi-objective assignment problem
• Uncertain multi-objective Chinese postman problem

Cited in

(2)

• Managing ESG ratings disagreement in sustainable portfolio selection
• On -cent-dians and generalized-center for network design: definitions and properties

This page was built for publication: The biobjective minimum-cost perfect matching problem and Chinese postman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6495384)