Pages that link to "Item:Q1277696"

The following pages link to A complete anytime algorithm for number partitioning (Q1277696):

Displaying 24 items.

• Two metaheuristic approaches for solving multidimensional two-way number partitioning problem (Q336995) (← links)
• Computer-assisted proof of performance ratios for the differencing method (Q435724) (← 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)
• Solving constrained combinatorial optimization problems via importance sampling in the grand canonical ensemble (Q709664) (← links)
• Weighted \(A^*\) search - unifying view and application (Q840833) (← links)
• Performance ratios of the Karmarkar-Karp differencing method (Q867023) (← links)
• Heuristics and exact methods for number partitioning (Q1038378) (← links)
• GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem (Q1652080) (← links)
• Block rearranging elements within matrix columns to minimize the variability of the row sums (Q1743640) (← links)
• Variable neighborhood descent applied to multi-way number partitioning problem (Q1791923) (← links)
• A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem (Q1792021) (← links)
• Lattice-based algorithms for number partitioning in the hard phase (Q1926495) (← links)
• A mixed-integer linear programming model to solve the multidimensional multi-way number partitioning problem (Q2026995) (← links)
• Variable neighborhood descent branching applied to the multi-way number partitioning problem (Q2132377) (← links)
• An algebraic expression of the number partitioning problem (Q2197434) (← links)
• Privacy-preserved distinct content collection in human-assisted ubiquitous computing systems (Q2215006) (← links)
• Genetic algorithms as a tool for structuring collaborative groups (Q2311315) (← links)
• Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
• A splitting method for stochastic programs (Q2507416) (← links)
• The packing radius of a code and partitioning problems: the case for poset metrics on finite vector spaces (Q2515553) (← links)
• HEURISTIC SEARCH UNDER CONTRACT (Q3224350) (← links)
• A physicist's approach to number partitioning (Q5958802) (← links)
• The paired mail carrier problem (Q6112565) (← links)