Amanote Research
Register
Sign In
A Fast Heuristic Algorithm for Solving High-Density Subset-Sum Problems
International Journal of Mathematical Sciences and Computing
doi 10.5815/ijmsc.2017.02.05
Full Text
Open PDF
Abstract
Available in
full text
Date
April 8, 2017
Authors
Akash Nag
Publisher
MECS Publisher
Related search
A Heuristic Method for Solving Airline Crew Pairing Problems
MATEC Web of Conferences
Materials Science
Engineering
Chemistry
Solving Constrained Optimization Problems via Subset Simulation
A Fast Algorithm for Fast Train Palindromic Quadratic Eigenvalue Problems
SIAM Journal of Scientific Computing
Computational Mathematics
Applied Mathematics
A New Multi-Objective Evolutionary Algorithm for Solving High Complex Multi-Objective Problems
Fast Exact and Heuristic Methods for Role Minimization Problems
Synthesis of Fast Programs for Maximum Segment Sum Problems
A Gossip Based Heuristic Algorithm for Heterogeneous Multi-Vehicle Routing Problems*
IFAC Proceedings Volumes
A Splitting Subgradient Algorithm for Solving Equilibrium Problems Involving the Sum of Two Bifunctions and Application to Cournot-Nash Model
RAIRO - Operations Research
Management Science
Computer Science Applications
Operations Research
Theoretical Computer Science
A Heuristic Planning Algorithm for Highly Constrained Maximum on Ground Problems
