Pages that link to "Item:Q4625646"
From MaRDI portal
The following pages link to Optimal Multi-Way Number Partitioning (Q4625646):
Displaying 19 items.
- Integer linear programming model for multidimensional two-way number partitioning problem (Q623171) (← links)
- A variant of multi-task \(n\)-vehicle exploration problem: maximizing every processor's average profit (Q692666) (← links)
- Heuristics and exact methods for number partitioning (Q1038378) (← links)
- A complete anytime algorithm for number partitioning (Q1277696) (← links)
- Lattice-based algorithms for number partitioning in the hard phase (Q1926495) (← links)
- A two-phase method for multidimensional number partitioning problem (Q1953146) (← links)
- General and efficient multisplitting of numerical attributes (Q1961320) (← links)
- A comparison of instance-level counterfactual explanation algorithms for behavioral and textual data: SEDC, LIME-C and SHAP-C (Q2022488) (← links)
- A mixed-integer linear programming model to solve the multidimensional multi-way number partitioning problem (Q2026995) (← links)
- Faster algorithms for \(k\)-subset sum and variations (Q2105266) (← links)
- Approximation algorithms for simple assembly line balancing problems (Q2125223) (← links)
- New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem (Q2125915) (← links)
- An algebraic expression of the number partitioning problem (Q2197434) (← links)
- Randomized methods for the number partitioning problem (Q2563882) (← links)
- Analysis of the simple assembly line balancing problem complexity (Q6047869) (← links)
- Tractability of explaining classifier decisions (Q6098842) (← links)
- Envy-free matchings in bipartite graphs and their applications to fair division (Q6154777) (← links)
- Constructing generalized suffix trees on distributed parallel platforms (Q6160551) (← links)
- The balanced maximally diverse grouping problem with integer attribute values (Q6166203) (← links)