Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations

DOI10.1016/J.COR.2023.106213OpenAlexW4323545770MaRDI QIDQ6164589FDOQ6164589

Authors: Trivikram Dokka, Marc Goerigk 

Publication date: 4 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106213

zbMATH Keywords

computational complexitycombinatorial optimizationapproximationbottleneck assignment

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Assignment Problems
• Computation of sharp bounds on the distribution of a function of dependent risks
• The complete mixability and convex minimization problems with monotone marginal densities
• A multi-level bottleneck assignment approach to the bus drivers' rostering problem
• Algorithms minimizing mean flow time: Schedule-length properties
• Block rearranging elements within matrix columns to minimize the variability of the row sums
• Optimal solutions for a dock assignment problem with trailer transportation
• Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum
• Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime
• On the Minimization of the Makespan Subject to Flowtime Optimality
• Exact solution algorithms for the maximum flow problem with additional conflict constraints
• Scheduling with incompatible jobs
• Approximation Algorithms for the Assembly Line Crew Scheduling Problem
• Approximating the multi-level bottleneck assignment problem
• Bounding stochastic dependence, joint mixability of matrices, and multidimensional bottleneck assignment problems
• Joint Mixability
• On minimizing the makespan when some jobs cannot be assigned on the same machine
• A model-free approach to multivariate option pricing
• Rearrangement algorithm and maximum entropy
• An exact algorithm for parallel machine scheduling with conflicts
• Makespan minimization on unrelated parallel machines with a few bags

Cited In (1)

• The Multicommodity Multilevel Bottleneck Assignment Problem

This page was built for publication: Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations

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