Pages that link to "Item:Q4625646"
From MaRDI portal
The following pages link to Optimal Multi-Way Number Partitioning (Q4625646):
Displayed 10 items.
- 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)
- 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)