Back to Results
First PageMeta Content
Subset sum problem / Multiprocessor scheduling / Applied mathematics / NP-complete problems / Theoretical computer science / Dynamic programming / Mathematical optimization


Performance Ratios for the Karmarkar-Karp Differencing Method Wil Michiels1 2 , Jan Korst2 , Emile Aarts1 2 , and Jan van Leeuwen3 1 Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
Add to Reading List

Document Date: 2003-04-07 04:13:26


Open Document

File Size: 233,75 KB

Share Result on Facebook

Company

The Netherlands Philips Research Laboratories / S V S A / S Ai S A / /

/

Event

FDA Phase / /

Facility

Eindhoven University of Technology / Utrecht University / /

IndustryTerm

polynomial-time algorithm / polynomial time algorithms / polynomial-time approximation algorithms / branch-and-bound algorithm / partial solutions / feasible solution / local search heuristics / binary search / partial solution / bin-packing algorithm / /

Organization

Utrecht University / Eindhoven University of Technology / LPT LDM / /

Person

Ai / Van Leeuwen / Holstlaan / /

Product

A9 / /

Technology

three algorithms / polynomial-time approximation algorithms / former algorithm / known polynomial-time algorithm / existing polynomial-time approximation algorithms / simulation / bin-packing algorithm / known polynomial time algorithms / branch-and-bound algorithm / polynomial-time algorithm / /

SocialTag