scientific article; zbMATH DE number 5504153
From MaRDI portal
Publication:3597151
Cited in
(21)- Heuristics and exact methods for number partitioning
- Correspondence principle as equivalence of categories
- Multi-service multi-facility network design under uncertainty
- Cover-encodings of fitness landscapes
- Lattice-based algorithms for number partitioning in the hard phase
- Feasibility criteria for high-multiplicity partitioning problems
- New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem
- Partitions, Diophantine equations, and control systems
- Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
- Multitask n-vehicle exploration problem: complexity and algorithm
- Forest resampling for distributed sequential Monte Carlo
- Network topology vulnerability/cost trade-off: model, application, and computational complexity
- Commutator length of powers in free products of groups
- A binary algebraic differential evolution for the multidimensional two-way number partitioning problem
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
- On some similarity of finite sets (and what we can say today about certain old problem)
- Integer linear programming model for multidimensional two-way number partitioning problem
- On optimization of finite-difference time-domain (FDTD) computation on heterogeneous and GPU clusters
- On two simple[st] learning tasks
- Approximation schemes for k-subset sum ratio and k-way number partitioning ratio
- A general branch-and-bound algorithm for fair division problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3597151)
