Biobjective optimization problems on matroids with binary costs
From MaRDI portal
Publication:6132760
DOI10.1080/02331934.2022.2044479arXiv2108.00709OpenAlexW3188085113MaRDI QIDQ6132760
Julia Sudhoff, Kathrin Klamroth, Jochen Gorski
Publication date: 14 July 2023
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.00709
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New approaches to multi-objective optimization
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Connectedness of efficient solutions in multiple objective combinatorial optimization
- Matroid optimization with the interleaving of two ordered sets
- On \(k\)-Max-optimization
- A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
- Color constrained combinatorial optimization problems
- Nonlinear multiobjective optimization
- Laplacian matrices of graphs: A survey
- On spanning tree problems with multiple objectives
- The minimum labeling spanning trees
- Genetic algorithm approach on multi-criteria minimum spanning tree problem
- A multiply constrained matroid optimization problem
- Matroid optimization with generalized constraints
- Empirical study of exact algorithms for the multi-objective spanning tree
- On the bicriterion - minimal cost/minimal label - spanning tree problem
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks
- On matroids with multiple objectives
- Efficient algorithms for a family of matroid intersection problems
- On Possibly Optimal Tradeoffs in Multicriteria Spanning Tree Problems
- A Survey on Multiple Objective Minimum Spanning Tree Problems
- Multicriteria Optimization
- Computation in multicriteria matroid optimization
- Comments on bases in dependence structures
This page was built for publication: Biobjective optimization problems on matroids with binary costs
