Multi-stage selection under bounded variation

DOI10.5802/OJMO.52MaRDI QIDQ7396483zbMATH OpenFDO

Authors Christoph Buchheim, Maja Hügging

Publication date 2026

Published in OJMO. Open Journal of Mathematical Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.5802/OJMO.52

Mathematics Subject Classification ID

Calculus of variations and optimal control; optimization (49-XX) Mathematical programming (90Cxx)

Cites work

• A general approximation for multistage subgraph problems
• A multistage view on 2-satisfiability
• A simple rounding scheme for multistage optimization
• Approximating multistage matching problems
• Bipartite temporal graphs and the parameterized complexity of multistage 2-coloring
• Changing bases: multistage optimization for matroids and matchings
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3179986 (Why is no real title available?)
• scientific article; zbMATH DE number 7238962 (Why is no real title available?)
• Interval selection with machine-dependent intervals
• LP-based algorithms for multistage minimization problems
• Matroid bases with cardinality constraints on the intersection
• Multistage \(s-t\) path: confronting similarity with dissimilarity
• Multistage knapsack
• Multistage vertex cover
• Online multistage subset maximization problems
• Parameterized Algorithms for Diverse Multistage Problems
• Robust recoverable and two-stage selection problems
• The complexity of independent set reconfiguration on bipartite graphs
• The polytope of binary sequences with bounded variation

This page was built for publication: Multi-stage selection under bounded variation

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