Shifted matroid optimization

DOI10.1016/j.orl.2016.05.013zbMath1380.90238arXiv1507.00447OpenAlexW2963988918MaRDI QIDQ1694792

Shmuel Onn, Asaf Levin

Publication date: 6 February 2018

Published in: Operations Research Letters (Search for Journal in Brave)

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

zbMATH Keywords

integer programmingcombinatorial optimizationmatchingspanning treematroidunimodular

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27) Matching models (91B68)

Related Items (5)

Optimization over Degree Sequences ⋮ Approximate separable multichoice optimization over monotone systems ⋮ Parameterized shifted combinatorial optimization ⋮ Decreasing minimization on M-convex sets: background and structures ⋮ Decreasing minimization on M-convex sets: algorithms and applications

Cites Work

• Nonlinear discrete optimization. An algorithmic theory
• The unimodular intersection problem
• Parametric nonlinear discrete optimization over well-described sets and matroid intersections
• Approximate Nonlinear Optimization over Weighted Independence Systems
• Nonlinear Matroid Optimization and Experimental Design
• The NP-Completeness of Edge-Coloring
• Disjoint Common Transversals and Exchange Structures
• Common transversals and strong exchange systems
• Unnamed Item
• Unnamed Item

This page was built for publication: Shifted matroid optimization