scientific article; zbMATH DE number 7788439
From MaRDI portal
Publication:6147356
Cited in
(20)- Markov Bases: A 25 Year Update
- FPT algorithms for a special block-structured integer program with applications in scheduling
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
- Integer programs with bounded subdeterminants and two nonzeros per row
- Robust scheduling on uniform machines. New results using a relaxed approximation guarantee
- Space-efficient algorithm for integer programming with few constraints
- (Near)-optimal algorithms for sparse separable convex integer programs
- Exact and approximate high-multiplicity scheduling on identical machines
- Parameterized algorithms for block-structured integer programs with large entries
- Fairness in repetitive scheduling
- Complexity of scheduling few types of jobs on related and unrelated machines
- Bribery in elections with randomly selected voters: hardness and algorithm
- Collapsing the tower -- on the complexity of multistage stochastic IPs
- Tight lower bounds for block-structured integer programs
- Tight lower bounds for block-structured integer programs
- Separable convex mixed-integer optimization: improved algorithms and lower bounds
- Parameterized algorithms on integer sets with small doubling: integer programming, subset sum and k-SUM
- A brief history of parameterized algorithms for block-structured integer programs (invited talk)
- A simple algorithm for combinatorial n-fold ILPs using the Steinitz lemma
- New algorithm for combinatorial n-folds and applications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6147356)
