The biobjective minimum-cost perfect matching problem and Chinese postman problem
From MaRDI portal
Publication:6495384
DOI10.1111/ITOR.13363MaRDI QIDQ6495384
Justo Puerto, Miguel A. Pozo, Ignacio Roldán
Publication date: 30 April 2024
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation with a fixed number of solutions of some multiobjective maximization problems
- Uncertain multi-objective Chinese postman problem
- Minimum perfect bipartite matchings and spanning trees under categorization
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Multiobjective solution of the uncapacitated plant location problem
- Ordered weighted average combinatorial optimization: formulations and their properties
- Two phase algorithms for the bi-objective assignment problem
- A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
- Optimal location of a path or tree on a network with cycles
- Solving matching problems with linear programming
- Odd Minimum Cut-Sets and b-Matchings
- Matching, Euler tours and the Chinese postman
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Reducibility among Combinatorial Problems
- Multicriteria Optimization
- Maximum matching and a polyhedron with 0,1-vertices
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Integer Programming and Combinatorial Optimization
- Core solutions in vector-valued games
This page was built for publication: The biobjective minimum-cost perfect matching problem and Chinese postman problem
