Optimal general factor problem and jump system intersection

DOI10.1007/S10107-024-02098-9MaRDI QIDQ7019060zbMATH OpenFDO

Authors Yusuke Kobayashi

Publication date 5 March 2025

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3750968 (Why is no real title available?)
• Antifactors of graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Complexity of Matroid Property Algorithms
• Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
• Discrete Convex Analysis
• General antifactors of graphs
• General factors of graphs
• Integer Programming and Combinatorial Optimization
• M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem
• Matching theory
• Matroid Parity and Jump Systems: A Solution to a Conjecture of Recski
• Matroid matching and some applications
• Operations on M‐Convex Functions on Jump Systems
• Optimal general factor problem and jump system intersection
• Optimal general matchings
• Packing subgraphs in a graph
• Paths, Trees, and Flowers
• Submodular functions and optimization.
• Terminal backup, 3D matching, and covering cubic graphs
• The factorization of graphs. II
• The membership problem in jump systems
• Time bounds of basic steepest descent algorithms for \(M\)-convex function minimization and related problems
• \(\Delta\)-matroid and jump system

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

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