Optimal multi-way number partitioning

DOI10.1145/3184400MaRDI QIDQ4625646zbMATH OpenOpenAlexWikidataFDO

Authors Ethan L. Schreiber, Richard E. Korf, Michael D. Moffitt

Publication date 25 February 2019

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3184400

zbMATH Keywords

combinatorial optimizationschedulingsearch

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• A complete anytime algorithm for number partitioning
• Heuristics and exact methods for number partitioning
• scientific article; zbMATH DE number 1185313
• Variable neighborhood descent applied to multi-way number partitioning problem
• The \(k\)-partitioning problem

Cited in

(22)

• Heuristics and exact methods for number partitioning
• A complete anytime algorithm for number partitioning
• Lattice-based algorithms for number partitioning in the hard phase
• A two-phase method for multidimensional number partitioning problem
• General and efficient multisplitting of numerical attributes
• A comparison of instance-level counterfactual explanation algorithms for behavioral and textual data: SEDC, LIME-C and SHAP-C
• A mixed-integer linear programming model to solve the multidimensional multi-way number partitioning problem
• Faster algorithms for \(k\)-subset sum and variations
• Approximation algorithms for simple assembly line balancing problems
• New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem
• Variable neighborhood descent branching applied to the multi-way number partitioning problem
• An algebraic expression of the number partitioning problem
• Randomized methods for the number partitioning problem
• Simple tabu search algorithm for the number partitioning problem
• Analysis of the simple assembly line balancing problem complexity
• Tractability of explaining classifier decisions
• Envy-free matchings in bipartite graphs and their applications to fair division
• Constructing generalized suffix trees on distributed parallel platforms
• The balanced maximally diverse grouping problem with integer attribute values
• Integer linear programming model for multidimensional two-way number partitioning problem
• A variant of multi-task \(n\)-vehicle exploration problem: maximizing every processor's average profit
• Approximation schemes for k-subset sum ratio and k-way number partitioning ratio

This page was built for publication: Optimal multi-way number partitioning

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