Optimal general factor problem and jump system intersection

DOI10.1007/978-3-031-32726-1_21zbMath1528.90269arXiv2209.00779OpenAlexW4377199965MaRDI QIDQ6086009

Yusuke Kobayashi

Publication date: 9 November 2023

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.00779

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\Delta\)-matroid and jump system
• General factors of graphs
• Matching theory
• Matroid matching and some applications
• Packing subgraphs in a graph
• General antifactors of graphs
• The membership problem in jump systems
• Antifactors of graphs
• Optimal general matchings
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Submodular functions and optimization.
• Terminal Backup, 3D Matching, and Covering Cubic Graphs
• Matroid Parity and Jump Systems: A Solution to a Conjecture of Recski
• Complexity of Matroid Property Algorithms
• Discrete Convex Analysis
• Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
• Paths, Trees, and Flowers
• Operations on M‐Convex Functions on Jump Systems
• M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem
• The factorization of graphs. II
• Integer Programming and Combinatorial Optimization

This page was built for publication: Optimal general factor problem and jump system intersection