The \(k\)-partitioning problem
From MaRDI portal
Publication:1298757
DOI10.1007/BF01193837zbMath0941.90029OpenAlexW2065011764MaRDI QIDQ1298757
Luitpold Babel, Hans Kellerer, Vladimir Kotov
Publication date: 22 August 1999
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01193837
Related Items
Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem, \(\kappa\)-partitioning problems for maximizing the minimum load, Short-term capacity allocation problem with tool and setup constraints, Operations research models for coalition structure in collaborative logistics, Optimizing the strategic patient mix combining queueing theory and dynamic programming, Gossip based asynchronous and randomized distributed task assignment with guaranteed performance on heterogeneous networks, Fast discrete consensus based on gossip for makespan minimization in networked systems, A 3/2-approximation algorithm for \(k_i\)-partitioning, Parallel machine scheduling with linearly increasing energy consumption cost, An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints, Computer-assisted proof of performance ratios for the differencing method, Approximation algorithms for \(k\)-partitioning problems with partition matroid constraint, Lower bounds and modified LPT algorithm for \(k\)-partitioning problems with partition matroid constraint, Bounds for the cardinality constrained \(P \|C_{max}\) problem, Minimizing labor requirements in a periodic vehicle loading problem, An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints, Optimal matroid partitioning problems, Min-Max partitioning problem with matroid constraint, Heuristic scheduling of parallel machines with sequence-dependent set-up times, \(k\)-partitioning problems with partition matroid constraint, Dividing splittable goods evenly and with limited fragmentation, Feasibility criteria for high-multiplicity partitioning problems, Unnamed Item, A new approach for bicriteria partitioning problem
Cites Work
