The following pages link to (Q3597151):
Displayed 19 items.
- Two metaheuristic approaches for solving multidimensional two-way number partitioning problem (Q336995) (← links)
- Multitask \(n\)-vehicle exploration problem: complexity and algorithm (Q394382) (← links)
- Integer linear programming model for multidimensional two-way number partitioning problem (Q623171) (← links)
- On optimization of finite-difference time-domain (FDTD) computation on heterogeneous and GPU clusters (Q635356) (← links)
- A general branch-and-bound algorithm for fair division problems (Q991365) (← links)
- Heuristics and exact methods for number partitioning (Q1038378) (← links)
- Correspondence principle as equivalence of categories (Q1702195) (← links)
- Multi-service multi-facility network design under uncertainty (Q1761754) (← links)
- Cover-encodings of fitness landscapes (Q1786928) (← links)
- Lattice-based algorithms for number partitioning in the hard phase (Q1926495) (← links)
- Feasibility criteria for high-multiplicity partitioning problems (Q2069802) (← links)
- New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem (Q2125915) (← links)
- Partitions, Diophantine equations, and control systems (Q2420414) (← links)
- Forest resampling for distributed sequential Monte Carlo (Q4970195) (← links)
- Network Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational Complexity (Q4985807) (← links)
- Commutator length of powers in free products of groups (Q5065436) (← links)
- A binary algebraic differential evolution for the multidimensional two-way number partitioning problem (Q6084514) (← links)
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)
- On some similarity of finite sets (and what we can say today about certain old problem) (Q6199497) (← links)